Beyond the universal Turing machine

We describe an emerging field, that of nonclassical computability and nonclassical computing machinery. According to the nonclassicist, the set of well-defined computations is not exhausted by the computations that can be carried out by a Turing machine. We provide an overview of the field and a philosophical defence of its foundations
Keywords Computation  Logic  Machine  Turing, A
Categories (categorize this paper)
DOI 10.1080/00048409912348801
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,667
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

View all 37 references / Add more references

Citations of this work BETA

View all 6 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

72 ( #47,201 of 1,726,249 )

Recent downloads (6 months)

9 ( #74,830 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.