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)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Some Doubts About Turing Machine Arguments.James D. Heffernan - 1978 - Philosophy of Science 45 (December):638-647.
The Foundations of Arithmetic in Finite Bounded Zermelo Set Theory.Richard Pettigrew - 2010 - Cahiers du Centre de Logique 17:99-118.
Philosophy of Mind Is (in Part) Philosophy of Computer Science.Darren Abramson - 2011 - Minds and Machines 21 (2):203-219.
Turing's Golden: How Well Turing's Work Stands Today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
Massively Parallel Distributed Processing and a Computationalist Foundation for Cognitive Science.Albert E. Lyngzeidetson - 1990 - British Journal for the Philosophy of Science 41 (March):121-127.
Consistency, Turing Computability and Gödel's First Incompleteness Theorem.Robert F. Hadley - 2008 - Minds and Machines 18 (1):1-15.
Gödel's Incompleteness Theorems and Computer Science.Roman Murawski - 1997 - Foundations of Science 2 (1):123-135.
Added to index2009-01-28
Total downloads24 ( #210,758 of 2,170,072 )
Recent downloads (6 months)1 ( #345,514 of 2,170,072 )
How can I increase my downloads?