Zur Startseite gehen
0,00 €*
Cover: 9781461269250 | Computability | A Mathematical Sketchbook | Douglas S. Bridges | Buch
Bild: 9781461269250 | Computability | A Mathematical Sketchbook | Douglas S. Bridges | Buch
Cover: 9781461269250 | Computability | A Mathematical Sketchbook | Douglas S. Bridges | Buch
Bild: 9781461269250 | Computability | A Mathematical Sketchbook | Douglas S. Bridges | Buch
Dekorationsartikel gehören nicht zum Leistungsumfang.
Computability
A Mathematical Sketchbook
Taschenbuch von Douglas S. Bridges
Sprache: Englisch

53,49 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Aktuell nicht verfügbar

Kategorien:
Beschreibung
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.
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.
Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: 2013
Fachbereich: Allgemeines
Genre: Mathematik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Graduate Texts in Mathematics
Inhalt: xi
180 S.
ISBN-13: 9781461269250
ISBN-10: 1461269253
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Bridges, Douglas S.
Auflage: Softcover reprint of the original 1st ed. 1994
Hersteller: Springer New York
Springer US, New York, N.Y.
Graduate Texts in Mathematics
Maße: 235 x 155 x 11 mm
Von/Mit: Douglas S. Bridges
Erscheinungsdatum: 13.07.2013
Gewicht: 0,306 kg
Artikel-ID: 105586034
Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: 2013
Fachbereich: Allgemeines
Genre: Mathematik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Graduate Texts in Mathematics
Inhalt: xi
180 S.
ISBN-13: 9781461269250
ISBN-10: 1461269253
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Bridges, Douglas S.
Auflage: Softcover reprint of the original 1st ed. 1994
Hersteller: Springer New York
Springer US, New York, N.Y.
Graduate Texts in Mathematics
Maße: 235 x 155 x 11 mm
Von/Mit: Douglas S. Bridges
Erscheinungsdatum: 13.07.2013
Gewicht: 0,306 kg
Artikel-ID: 105586034
Warnhinweis

Ähnliche Produkte

Diese Website verwendet Cookies, um eine bestmögliche Erfahrung bieten zu können. Mehr Informationen ...