web nectar

Wectar - Science - Math - Logic and Foundations - Computability

         

  submit a site to this category
   
Subcategories
Asynchronous Computability@Quantum Computing@


URL: http://en.wikipedia.org/wiki/Interactive_computation
ODP description: Wikipedia article.
Page title: Interactive computation - Wikipedia, the free encyclopedia

URL: http://math.berkeley.edu/~slaman/qrt/
ODP description: Compiled by Theodore A. Slaman, Berkeley [TeX/PDF].
Page title: Theodore A. Slaman: Homepage

URL: http://www.media.mit.edu/physics/pedagogy/babbage/texts/rt.html
ODP description: Notes from the class taught by Prof. Sacks in the Spring of 1998.
Page title: Logic, 8

URL: http://plato.stanford.edu/entries/church-turing/
ODP description: Jack Copeland of the University of Canterbury, New Zealand outlines this frequently misunderstood thesis.
Page title: The Church-Turing Thesis (Stanford Encyclopedia of Philosophy)

URL: http://www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html
ODP description: An online course on complexity.

URL: http://www-cgi.cs.purdue.edu/cgi-bin/acc/pses.cgi
ODP description: This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs.
Page title: Problem Solving Environments Home Page
Page description: A PSE is a computer system that provides all the computational facilities needed to solve a target class of problems. The PSEs research group in the Computer Sciences Department at Purdue University provides a home page with information about PSE software.

URL: http://www.cca-net.de/
ODP description: The CCA Network provides some useful information for researchers working in the field of computability and complexity in analysis.
Page title: Computability and Complexity in Analysis - Network

URL: http://www.nd.edu/~cholak/computability/computability.html
ODP description: Information on this site includes a Bibliographic Database for Computability Theory, a list of Open Questions in Recursion Theory as well as links to many researchers working in the field. Maintained by Peter Cholak.

URL: http://www.hypercomputation.net/
ODP description: 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.
Page title: Home Page - Hypercomputation Research Network (http://hypercomputation.net)

URL: http://en.wiktionary.org/wiki/Computability_logic
ODP description: A dictionary definition of the subject.
Page title: computability logic - Wiktionary

URL: http://www.nd.edu/~cholak/computability/bib/bib.html
ODP description: Extensive bibliography on computability and recursion theory, maintained by Peter Cholak.
Page title: A Bibliographic Database for Computably Theory



  
Help build the largest human-edited directory on the web.
Submit a Site - Open Directory Project - Become an Editor
  powered by Sphinx