Search preferences

Produktart

  • Alle Produktarten
  • Bücher (1)
  • Magazine & Zeitschriften
  • Comics
  • Noten
  • Kunst, Grafik & Poster
  • Fotografien
  • Karten
  • Manuskripte &
    Papierantiquitäten

Zustand

  • Alle
  • Neu
  • Antiquarisch/Gebraucht

Einband

Weitere Eigenschaften

  • Erstausgabe
  • Signiert
  • Schutzumschlag
  • Angebotsfoto

Land des Verkäufers

Verkäuferbewertung

  • Borut Robi¿

    Verlag: Springer Berlin Heidelberg, 2016

    ISBN 10: 3662516012ISBN 13: 9783662516010

    Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

    Bewertung: 5 Sterne, Learn more about seller ratings

    Verkäufer kontaktieren

    Buch

    EUR 32,99 Versand

    Von Deutschland nach USA

    Anzahl: 1

    In den Warenkorb

    Taschenbuch. Zustand: 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. 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.