Complexity 4 (1):30-32 (1998)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1002/(SICI)1099-0526(199809/10)4:1<30::AID-CPLX9>3.0.CO;2-8
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,018
Through your library

References found in this work BETA

On Computable Numbers, with an Application to the N Tscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Systems of Logic Based on Ordinals.Alan Mathison Turing - 1939 - London: Printed by C.F. Hodgson & Son.
The Church-Turing Thesis.B. Jack Copeland - 2008 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Stanford University.
Beyond the Universal Turing Machine.B. Jack Copeland & Richard Sylvan - 1999 - Australasian Journal of Philosophy 77 (1):46-66.
Infinite Time Turing Machines.Joel Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.

View all 9 references / Add more references

Citations of this work BETA

Hypercomputation.B. Jack Copeland - 2002 - Minds and Machines 12 (4):461-502.
Hypercomputation and the Physical Church‐Turing Thesis.Paolo Cotogno - 2003 - British Journal for the Philosophy of Science 54 (2):181-223.
Accelerating Turing Machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.

View all 18 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2013-11-01

Total views
104 ( #111,096 of 2,498,529 )

Recent downloads (6 months)
1 ( #426,098 of 2,498,529 )

How can I increase my downloads?

Downloads

My notes