Computability Theory: An Introduction to Recursion Theory
- ISBN-10
- 1282955152
- ISBN-13
- 9781282955158
- Category
- Computable functions
- Pages
- 192
- Language
- English
- Published
- 2011
- Author
- Herbert B. Enderton
Description
This textbook is designed to introduce undergraduate mathematics and computer science students to computability theory (recursion theory). It is based on teaching experience, and is designed to be accessible to junior and senior students without a previous background in the subject. Computability Theory: aAn Introduction to Recursion Theory, aprovides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. aThe text includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science. aComputability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable way. Frequent historical information presented throughout More extensive motivation for each of the topics than other texts currently available Connects with topics not included in other textbooks, such as complexity theory a.
Get the book
Other editions
Similar books
-
Effective Mathematics of the Uncountable
By Russell Miller, Noam Greenberg, Denis Roman HirschfeldtThis book provides an authoritative and multifaceted introduction to this exciting new area of research that is still in its early stages.
-
Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
By Karen Lange, Denis R. Hirschfeldt, Richard A. Shore... Fabrizio Colombo, Irene Sabadini, Daniele C. Struppa, and Jeff Tollaksen, The Mathematics of Superoscillations, 2017 C. L. Fefferman, J. P. Lee-Thorp, and M. I. Weinstein, Topologically Protected States in One-Dimensional Systems, ...
-
Introduction to Formal Languages, Automata Theory and Computation
By Kamala KrithivasanThe book also examines the underlying theory and principles of computation and is highly suitable to the undergraduate courses in computer science and information technology.
-
Introduction to Languages and the Theory of Computation
By John C. MartinA distinctive feature of this text is its gentle and gradual introduction of the necessary mathematical tools in the context in which they are used.
-
Discrete Structures, Logic, and Computability
By James L. HeinWritten for prospective computer scientist, computer engineers, or applied mathematicians, who want to learn about the ideas that inspire computer science, this edition contains an extensive coverage of logic, setting it apart from similar ...
-
Computability: Computable Functions, Logic, and the Foundations of Mathematics
By Richard L. EpsteinComputability: Computable Functions, Logic, and the Foundations of Mathematics
-
An Early History of Recursive Functions and Computability: From Gödel to Turing
By Rod AdamsTraces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.
-
Automata, Computability and Complexity: Theory and Applications
By Elaine RichAutomata, Computability and Complexity: Theory and Applications
-
Automata, Computability and Complexity: Theory and Applications
By Elaine RichAutomata, Computability and Complexity: Theory and Applications
-
Effective Mathematics of the Uncountable
By Russell Miller, Noam Greenberg, Joel DavidA comprehensive introduction to eight major approaches to computation on uncountable mathematical domains.