'Turing limit'. Some of them (Steinhart, Copeland) represent extensions of Tur-ing's account, whereas others defend alternatives notions of effective computability (Bringsjord and Zenzen, Wells)

Minds and Machines 12:157-158 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Hypercomputation.B. Jack Copeland - 2002 - Minds and Machines 12 (4):461-502.
SAD computers and two versions of the Church–Turing thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
The Church-Turing Thesis.B. Jack Copeland - 2014 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. Stanford, CA: The Metaphysics Research Lab.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
On effective procedures.Carol E. Cleland - 2002 - Minds and Machines 12 (2):159-179.
Beyond the universal Turing machine.Jack Copeland - 1999 - Australasian Journal of Philosophy 77 (1):46-67.
Godel on computability.W. Sieg - 2006 - Philosophia Mathematica 14 (2):189-207.
Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.

Analytics

Added to PP
2014-03-24

Downloads
22 (#705,671)

6 months
1 (#1,462,504)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Carol Cleland
University of Colorado, Boulder

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references