Computability Logic and Foundations Math

@Intermall

Top: Science: Math: Logic_and_Foundations: Computability:

• Top/Computers/Computer Science
• Top/Computers/Computer Science/Theoretical/Complexity Theory

• - An online course on complexity.
  
• - Directory of researchers working in computability theory, and list of open problems.
  
• - The Electronic Colloquium on Computational Complexity is a new forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity. The Electronic Colloquium on Computational Complexity (ECCC) welcomes papers, s
  
• - The study of computation beyond that defined by the Turing machine, also known as super-Turing, non-standard or non-recursive computation. Links to people, resources and discussions.
  
• - Compiled by Theodore A. Slaman, Berkeley [TeX/PDF].
  
• - Extensive bibliography on computability and recursion theory, maintained by Peter Cholak.
  
• - Notes from the class taught by Prof. Sacks in the Spring of 1998.
  
• - Alonzo Church and Alan Turing formulated the thesis that computability coincides with recursivity; by Jack Copeland.
  
• - Encyclopedia article.
  
• - Wikipedia article.
  
• - A dictionary definition of the subject.
  
• - This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs.