David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
A machine equivalent to Turing machine, that is more intuitive in its working is defined. Three derivation rules are added to Elementary Arithmetic of Godel and his incompleteness theorems are proved without using any metalanguage. Two axioms are added to Zermelo-Fraenkel theory to derive the Continuum Hypothesis and to split the unit interval into infinitesimals.
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
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
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
James D. Heffernan (1978). Some Doubts About Turing Machine Arguments. Philosophy of Science 45 (December):638-647.
Richard Pettigrew (2010). The Foundations of Arithmetic in Finite Bounded Zermelo Set Theory. Cahiers du Centre de Logique 17:99-118.
Darren Abramson (2011). Philosophy of Mind Is (in Part) Philosophy of Computer Science. Minds and Machines 21 (2):203-219.
Justin Leiber (2006). Turing's Golden: How Well Turing's Work Stands Today. Philosophical Psychology 19 (1):13-46.
Albert E. Lyngzeidetson (1990). Massively Parallel Distributed Processing and a Computationalist Foundation for Cognitive Science. British Journal for the Philosophy of Science 41 (March):121-127.
Robert F. Hadley (2008). Consistency, Turing Computability and Gödel's First Incompleteness Theorem. Minds and Machines 18 (1):1-15.
Roman Murawski (1997). Gödel's Incompleteness Theorems and Computer Science. Foundations of Science 2 (1):123-135.
Added to index2009-01-28
Total downloads2 ( #325,414 of 1,096,519 )
Recent downloads (6 months)0
How can I increase my downloads?