The Foundations of Computability Theory

0 durchschnittliche Bewertung
( 0 Bewertungen bei GoodReads )
 
9783662448076: The Foundations of Computability Theory
Vom Verlag:

This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism; in Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability; in Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, and c.e. degrees and the priority method. This is a gentle introduction from the origins of computability theory up to current research, and it will be of value as a textbook and guide for advanced undergraduate and graduate students and researchers in the domains of computability theory and theoretical computer science.

Über den Autor:

Prof. Borut Robi? received his Ph.D. in Computer Science from the University of Ljubljana in 1993. He is a member of the Faculty of Computer and Information Science of the University of Ljubljana where he leads the Laboratory for Algorithms and Data Structures. He has had guest professorships, fellowships and collaborations with the University of Cambridge, the University of Augsburg, the University of Grenoble, and the Jo?ef Stefan Institute in Ljubljana. His research interests and teaching experience address algorithms; computability and computational complexity theory; parallel, distributed and grid computing; operating systems; and processor architectures.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Neu kaufen Angebot ansehen

Versand: EUR 29,50
Von Deutschland nach USA

Versandziele, Kosten & Dauer

In den Warenkorb

Beste Suchergebnisse beim ZVAB

1.

Robic, Borut
Verlag: Springer-Verlag Gmbh Sep 2015 (2015)
ISBN 10: 3662448076 ISBN 13: 9783662448076
Neu Anzahl: 1
Anbieter
AHA-BUCH GmbH
(Einbeck, Deutschland)
Bewertung
[?]

Buchbeschreibung Springer-Verlag Gmbh Sep 2015, 2015. Buch. Buchzustand: Neu. 241x155x25 mm. Neuware - This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism; in Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability; in Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, c.e. degrees and the priority method, and the arithmetical hierarchy. This is a gentle introduction from the origins of computability theory up to current research, and it will be of value as a textbook and guide for advanced undergraduate and graduate students and researchers in the domains of computability theory and theoretical computer science. 331 pp. Englisch. Artikel-Nr. 9783662448076

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 64,19
Währung umrechnen

In den Warenkorb

Versand: EUR 29,50
Von Deutschland nach USA
Versandziele, Kosten & Dauer