A simple generalization of Turing computability
Notre Dame Journal of Formal Logic 20 (1):95-102 (1979)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links |
|
| Through your library | Configure |
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
Guido Gherardi (2011). Alan Turing and the Foundations of Computable Analysis. Bulletin of Symbolic Logic 17 (3):394-430.
W. Sieg (2006). Godel on Computability. Philosophia Mathematica 14 (2):189-207.
B. Jack Copeland (2002). Accelerating Turing Machines. Minds and Machines 12 (2):281-300.
Mark Hogarth (1994). Non-Turing Computers and Non-Turing Computability. Psa 1994:126--138.
Michael Rescorla (2007). Church's Thesis and the Conceptual Analysis of Computability. Notre Dame Journal of Formal Logic 48 (2):253-280.
Eli Dresner (2008). Turing-, Human- and Physical Computability: An Unasked Question. Minds and Machines 18 (3).
Giangiacomo Gerla (1989). Turing L -Machines and Recursive Computability for L -Maps. Studia Logica 48 (2):179 - 192.
Oron Shagrir (2002). Effective Computation by Humans and Machines. Minds and Machines 12 (2):221-240.
Peter Koepke (2005). Turing Computations on Ordinals. Bulletin of Symbolic Logic 11 (3):377-397.
Joel David Hamkins (2002). Infinite Time Turing Machines. Minds and Machines 12 (4):567-604.
Joel David Hamkins & Andy Lewis (2000). Infinite Time Turing Machines. Journal of Symbolic Logic 65 (2):567-604.
Jack Copeland (1999). Beyond the Universal Turing Machine. Australasian Journal of Philosophy 77 (1):46-67.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-24Total downloads1 ( #274,556 of 548,980 )Recent downloads (6 months)0How can I increase my downloads? |

