Bookbot

Boolean Functions and Computation Models

Buchbewertung

4,0(1)Abgeben

Parameter

Seitenzahl
620 Seiten
Lesezeit
22 Stunden

Mehr zum Buch

The book delves into the historical development of computational complexity theory, tracing its roots back to Alan Thring's inquiries in the 1930s about automatic procedures for validating mathematical statements. It explores key concepts such as the undecidability of the Halting Problem and the quantitative aspects of problem-solving, introducing contributions from notable figures like A. Cobham, M. Rabin, and C. Shannon. Additionally, it examines the philosophical implications of computation, particularly John von Neumann's reflections on the relationship between computation and human cognition.

Publikation

Buchkauf

Boolean Functions and Computation Models, Peter Clote, Evangelos Kranakis

Sprache
Erscheinungsdatum
2010
product-detail.submit-box.info.binding
(Paperback)
Wir benachrichtigen dich per E-Mail.

Lieferung

  •  

Zahlungsmethoden

4,0
Sehr gut
1 Bewertung

Hier könnte deine Bwertung stehen.