5. Österreichische Artificial-Intelligence-Tagung pp 397-406 | Cite as
Reflections upon Turing’s analysis of the process of computation and its relation to AI
Conference paper
Abstract
From today’s point of view, Turing — in his influential paper of 19361 — was concerned with grasping the epistemological concept of effectively computable functions within the frame of the then mathematical research. Turing talks (resp. writes) of computable numbers, yet already in the introduction to his paper he hints at a possible extension of his appraoch: “it is almost equally easy to define and investigate computable functions of an integral variable or a real computable variable, computable predicates and so forth.” [230, my emphasis]
Keywords
Turing Machine Recursive Function Computable Function Abstract Structure Physical Machine
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
Copyright information
© Springer-Verlag Berlin Heidelberg 1989