9783662624203 - The Foundations of Computability Theory de Robi?, Borut (15 resultados)

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New. In.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New. 2nd edition NO-PA16APR2015-KAP.

Hardcover. Condición: Brand New. 2nd edition. 443 pages. 9.25x6.10x1.02 inches. In Stock.

Hardcover. Condición: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Finally, in the new Part IV the author revisits thecomputability (Church-Turing) thesis in greater detail. He offers a systematic and detailed account of its origins, evolution, and meaning, he describes more powerful, modern versions of the thesis, and he discusses recent speculative proposals for new computing paradigms such as hypercomputing.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.This new edition is completely revised, with almost one hundred pages of new material. In particular the author applied more up-to-date, more consistent terminology, and he addressed some notational redundancies and minor errors. He developed a glossary relating to computability theory, expanded the bibliographic references with new entries, and added the new part described above and other new sections.

Condición: new. Questo è un articolo print on demand.

Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - 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. Finally, in the new Part IV the author revisits thecomputability (Church-Turing) thesis in greater detail. He offers a systematic and detailed account of its origins, evolution, and meaning, he describes more powerful, modern versions of the thesis, and he discusses recent speculative proposals for new computing paradigms such as hypercomputing.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.This new edition is completely revised, with almost one hundred pages of new material. In particular the author applied more up-to-date, more consistent terminology, and he addressed some notational redundancies and minor errors. He developed a glossary relating to computability theory, expanded the bibliographic references with new entries, and added the new part described above and other new sections. 444 pp. Englisch.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Original, informative view of the development of the fundamental concepts of computability theoryAvoids excessive formalism, offering instead intuitive understandingCharacterized by appreciation of historical context and motivation of the l.

Condición: New. Print on Demand.

Condición: New. PRINT ON DEMAND.

Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. 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. Finally, in the new Part IV the author revisits thecomputability (Church-Turing) thesis in greater detail. He offers a systematic and detailed account of its origins, evolution, and meaning, he describes more powerful, modern versions of the thesis, and he discusses recent speculative proposals for new computing paradigms such as hypercomputing.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.This new edition is completely revised, with almost one hundred pages of new material. In particular the author applied more up-to-date, more consistent terminology, and he addressed some notational redundancies and minor errors. He developed a glossary relating to computability theory, expanded the bibliographic references with new entries, and added the new part described above and other new sections.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 444 pp. Englisch.