Bookbot

Boolean Functions and Computation Models

Valutazione del libro

4,0(1)Aggiungi una valutazione

Parametri

Pagine
620pagine
Tempo di lettura
22ore

Maggiori informazioni sul libro

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.

Pubblicazione

Acquisto del libro

Boolean Functions and Computation Models, Peter Clote, Evangelos Kranakis

Lingua
Pubblicato
2010
product-detail.submit-box.info.binding
(In brossura)
Ti avviseremo via email non appena lo rintracceremo.

Metodi di pagamento

4,0
Molto buono
1 Valutazioni

Qui potrebbe esserci la tua recensione.