Articoli correlati a Turing's World 3.0 for Windows
Sinossi
Turing's World is a self-contained introduction to Turing machines, one of the fundamental notions of logic and computer science. The text and accompanying diskette allow the user to design, debug, and run sophisticated Turing machines in a graphical environment. Turing's World introduces users to the key concepts in computability theory through a sequence of over 100 exercises and projects. Within minutes, users learn to build simple Turing machines using a convenient package of graphical functions. Exercises then progress through a significant portion of elementary computability theory, covering such topics as the Halting problem, the Busy Beaver function, recursive functions and undecidability. Version 3.0 is an extensive revision and enhancement of earlier releases of the program, allowing the construction of one-way and two-way finite state machines (finite automata), as well as non-deterministic Turing and finite-state machines. Special exercises allow users to explore these alternative machines.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Recensione
'Turing's World is a delight … I heartily recommend [it].' James Moor, Teaching Philosophy
'Turing's World quite literally revolutionises the way the fundamental theoretical issues of computing can be taught.' Keith Devlin, The Guardian
'There is not the slightest hint of jargon anywhere in [this book]. The explanations are so direct that a beginner will understand them and an old hand will enjoy them.' Wilfred Hodges, Queen Mary College
'The program and manual are the best introduction to Turing machines the reviewer knows of, or can imagine.' George Boolos, Journal of Symbolic Logic
Descrizione del libro
Turing's World introduces users to the key concepts in computability theory through a sequence of over 100 exercises and projects. Version 3.0 is an extensive revision and enhancement of earlier releases of the program, allowing the construction of one-way and two-way finite state machines (finite automata), as well as non-deterministic Turing and finite-state machines.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
(nessuna copia disponibile)
Cerca: Inserisci un desiderataNon riesci a trovare il libro che stai cercando? Continueremo a cercarlo per te. Se uno dei nostri librai lo aggiunge ad AbeBooks, ti invieremo una notifica!
Inserisci un desiderata
