Computability - Douglas S. Bridges

Computability

A Mathematical Sketchbook
Buch | Softcover
180 Seiten
2013 | Softcover reprint of the original 1st ed. 1994
Springer-Verlag New York Inc.
978-1-4612-6925-0 (ISBN)
53,49 inkl. MwSt
Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included.

Preliminaries.- 1 What Is a Turing Machine?.- 2 Computable Partial Functions.- 3 Effective Enumerations.- 4 Computable Numbers and Functions.- 5 Rice’s Theorem and the Recursion Theorem.- 6 Abstract Complexity Theory.- Solutions to Exercises.- Solutions for Chapter 1.- Solutions for Chapter 2.- Solutions for Chapter 3.- Solutions for Chapter 4.- Solutions for Chapter 5.- Solutions for Chapter 6.- References.

Reihe/Serie Graduate Texts in Mathematics ; 146
Zusatzinfo XI, 180 p.
Verlagsort New York, NY
Sprache englisch
Maße 155 x 235 mm
Themenwelt Mathematik / Informatik Mathematik
ISBN-10 1-4612-6925-3 / 1461269253
ISBN-13 978-1-4612-6925-0 / 9781461269250
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Von Logik und Mengenlehre bis Zahlen, Algebra, Graphen und …

von Bernd Baumgarten

Buch | Softcover (2024)
De Gruyter Oldenbourg (Verlag)
69,95
fundiert, vielseitig, praxisnah

von Friedhelm Padberg; Christiane Benz

Buch | Softcover (2021)
Springer Berlin (Verlag)
32,99