Results 1 
6 of
6
A NATURAL AXIOMATIZATION OF COMPUTABILITY AND PROOF OF CHURCH’S THESIS
"... Abstract. Church’s Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingcomputable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally e ..."
Abstract

Cited by 21 (10 self)
 Add to MetaCart
Abstract. Church’s Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingcomputable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally equivalent to an abstract state machine. This theorem presupposes three natural postulates about algorithmic computation. Here, we show that augmenting those postulates with an additional requirement regarding basic operations gives a natural axiomatization of computability and a proof of Church’s Thesis, as Gödel and others suggested may be possible. In a similar way, but with a different set of basic operations, one can prove Turing’s Thesis, characterizing the effective string functions, and—in particular—the effectivelycomputable functions on string representations of numbers.
Computational Logic and Human Thinking: How to be Artificially Intelligent
, 2011
"... The mere possibility of Artificial Intelligence (AI) – of machines that can think and act as intelligently as humans – can generate strong emotions. While some enthusiasts are excited by the thought that one day machines may become more intelligent than people, many of its critics view such a prosp ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
The mere possibility of Artificial Intelligence (AI) – of machines that can think and act as intelligently as humans – can generate strong emotions. While some enthusiasts are excited by the thought that one day machines may become more intelligent than people, many of its critics view such a prospect with horror. Partly because these controversies attract so much attention, one of the most important accomplishments of AI has gone largely unnoticed: the fact that many of its advances can also be used directly by people, to improve their own human intelligence. Chief among these advances is Computational Logic. Computational Logic builds upon traditional logic, which was originally developed to help people think more effectively. It employs the techniques of symbolic logic, which has been used to build the foundations of mathematics and computing. However, compared with traditional logic, Computational Logic is much more powerful; and compared with symbolic logic, it is much simpler and more practical. Although the applications of Computational Logic in AI require the use of mathematical notation, its human applications do not. As a consequence, I have written the main part of this book informally, to reach as wide an audience as possible. Because human thinking is also the subject of study in many other fields, I have drawn upon related studies in Cognitive Psychology, Linguistics, Philosophy, Law, Management Science and English
Incompleteness, Mechanism, And Optimism
, 1998
"... this paper would be "G odel, Lucas, Penrose, Turing, Feferman, Dummett, mechanism, optimism, reflection, and indefinite extensibility". Adding "God and the Devil" would probably be redundant. Despite the breathtaking, whirlwind tour, I have the modest aim of forging connections between di#erent par ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
this paper would be "G odel, Lucas, Penrose, Turing, Feferman, Dummett, mechanism, optimism, reflection, and indefinite extensibility". Adding "God and the Devil" would probably be redundant. Despite the breathtaking, whirlwind tour, I have the modest aim of forging connections between di#erent parts of this literature and clearing up some confusions, together with the less modest aim of not introducing any more confusions.
Reason and intuition
 Synthese
, 2000
"... In this paper I will approach the subject of intuition from a different angle from what has been usual in the philosophy of mathematics, by beginning with some descriptive remarks about Reason and observing that something that has been called intuition arises naturally in that context. These conside ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper I will approach the subject of intuition from a different angle from what has been usual in the philosophy of mathematics, by beginning with some descriptive remarks about Reason and observing that something that has been called intuition arises naturally in that context. These considerations are quite general, not specific to mathematics. The conception of intuition might be called that of rational intuition; indeed the conception is a much more modest version of conceptions of intuition held by rationalist philosophers. Moreover, it answers to a quite widespread use of the word “intuition ” in philosophy and elsewhere. But it does not obviously satisfy conditions associated with other conceptions of intuition that have been applied to mathematics. Intuition in a sense like this has, in writing about mathematics, repeatedly been run together with intuition in other senses. In the last part of the paper a little will be said about the connections that give rise to this phenomenon. * An abridgement of an earlier version of this paper was presented to a session on Mathematical Intuition at the 20th World Congress of Philosophy in
A natural axiomatization of Church’s thesis
, 2007
"... The Abstract State Machine Thesis asserts that every classical algorithm is behaviorally equivalent to an abstract state machine. This thesis has been shown to follow from three natural postulates about algorithmic computation. Here, we prove that augmenting those postulates with an additional requ ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The Abstract State Machine Thesis asserts that every classical algorithm is behaviorally equivalent to an abstract state machine. This thesis has been shown to follow from three natural postulates about algorithmic computation. Here, we prove that augmenting those postulates with an additional requirement regarding basic operations implies Church’s Thesis, namely, that the only numeric functions that can be calculated by effective means are the recursive ones (which are the same, extensionally, as the Turingcomputable numeric functions). In particular, this gives a natural axiomatization of Church’s Thesis, as Gödel and others suggested may be possible.