David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Cambridge University Press (1980)
What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest.
|Keywords||Computable functions Recursion theory|
|Categories||categorize this paper)|
|Buy the book||$39.00 used (40% off) $54.22 new (17% off) $54.22 direct from Amazon (17% off) Amazon page|
|ISBN(s)||0521223849 0521294657 9780521294652|
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
Jeffrey Ketland (2005). Some More Curious Inferences. Analysis 65 (285):18–24.
Julia Uddén, Martin Ingvar, Peter Hagoort & Karl M. Petersson (2012). Implicit Acquisition of Grammars With Crossed and Nested Non-Adjacent Dependencies: Investigating the Push-Down Stack Model. Cognitive Science 36 (6):1078-1101.
Andrzej Wiśniewski & Jerzy Pogonowski (2010). Diagonalization in Double Frames. Logica Universalis 4 (1):31-39.
Karl Magnus Petersson, Christian Forkstam & Martin Ingvar (2004). Artificial Syntactic Violations Activate Broca's Region. Cognitive Science 28 (3):383-407.
Hilbert Levitz & Warren Nichols (1987). Eine Rekursive Universelle Funktion Für Die Primitiv‐Rekursiven Funktionen. Mathematical Logic Quarterly 33 (6):527-535.
Similar books and articles
Stewart Shapiro (1983). Remarks on the Development of Computability. History and Philosophy of Logic 4 (1-2):203-220.
George Boolos, John Burgess, Richard P. & C. Jeffrey (2007). Computability and Logic. Cambridge University Press.
Arto Salomaa (1985). Computation and Automata. Cambridge University Press.
Piergiorgio Odifreddi (1989). Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers. Sole Distributors for the Usa and Canada, Elsevier Science Pub. Co..
Herbert B. Enderton (2011). Computability Theory: An Introduction to Recursion Theory. Academic Press.
S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) (1996). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press.
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
Added to index2009-01-28
Total downloads38 ( #51,642 of 1,413,325 )
Recent downloads (6 months)3 ( #67,208 of 1,413,325 )
How can I increase my downloads?