Countdown header img 1

MAI SUNT 00:00:00:00

MAI SUNT

X

Countdown header img  mob

MAI SUNT 00:00:00:00

MAI SUNT

X

Promotii popup img

2+1 GRATIS la editura NEMIRA!

Calatorie cu titluri SFantastice.

Deschide portalul cu noi lecturi!

Comanda acum!
Close

Turing's Vision: The Birth of Computer Science

Turing's Vision: The Birth of Computer Science - Chris Bernhardt

Turing's Vision: The Birth of Computer Science


Turing's fascinating and remarkable theory, which now forms the basis of computer science, explained for the general reader.

In 1936, when he was just twenty-four years old, Alan Turing wrote a remarkable paper in which he outlined the theory of computation, laying out the ideas that underlie all modern computers. This groundbreaking and powerful theory now forms the basis of computer science. In Turing's Vision, Chris Bernhardt explains the theory, Turing's most important contribution, for the general reader. Bernhardt argues that the strength of Turing's theory is its simplicity, and that, explained in a straightforward manner, it is eminently understandable by the nonspecialist. As Marvin Minsky writes, "The sheer simplicity of the theory's foundation and extraordinary short path from this foundation to its logical and surprising conclusions give the theory a mathematical beauty that alone guarantees it a permanent place in computer theory." Bernhardt begins with the foundation and systematically builds to the surprising conclusions. He also views Turing's theory in the context of mathematical history, other views of computation (including those of Alonzo Church), Turing's later work, and the birth of the modern computer.

In the paper, "On Computable Numbers, with an Application to the Entscheidungsproblem," Turing thinks carefully about how humans perform computation, breaking it down into a sequence of steps, and then constructs theoretical machines capable of performing each step. Turing wanted to show that there were problems that were beyond any computer's ability to solve; in particular, he wanted to find a decision problem that he could prove was undecidable. To explain Turing's ideas, Bernhardt examines three well-known decision problems to explore the concept of undecidability; investigates theoretical computing machines, including Turing machines; explains universal machines; and proves that certain problems are undecidable, including Turing's problem concerning computable numbers.

Citeste mai mult

-15%

94.76Lei

111.48 Lei

Sau 9476 de puncte

!

Fiecare comanda noua reprezinta o investitie pentru viitoarele tale comenzi. Orice comanda plasata de pe un cont de utilizator primeste in schimb un numar de puncte de fidelitate, In conformitate cu regulile de conversiune stabilite. Punctele acumulate sunt incarcate automat in contul tau si pot fi folosite ulterior, pentru plata urmatoarelor comenzi.

Livrare in 3-5 saptamani

Plaseaza rapid comanda

Important icon msg

Completeaza mai jos numarul tau de telefon

Poti comanda acest produs introducand numarul tau de telefon. Vei fi apelat de un operator Libris.ro in cele mai scurt timp pentru prealuarea datelor necesare.

Descrierea produsului


Turing's fascinating and remarkable theory, which now forms the basis of computer science, explained for the general reader.

In 1936, when he was just twenty-four years old, Alan Turing wrote a remarkable paper in which he outlined the theory of computation, laying out the ideas that underlie all modern computers. This groundbreaking and powerful theory now forms the basis of computer science. In Turing's Vision, Chris Bernhardt explains the theory, Turing's most important contribution, for the general reader. Bernhardt argues that the strength of Turing's theory is its simplicity, and that, explained in a straightforward manner, it is eminently understandable by the nonspecialist. As Marvin Minsky writes, "The sheer simplicity of the theory's foundation and extraordinary short path from this foundation to its logical and surprising conclusions give the theory a mathematical beauty that alone guarantees it a permanent place in computer theory." Bernhardt begins with the foundation and systematically builds to the surprising conclusions. He also views Turing's theory in the context of mathematical history, other views of computation (including those of Alonzo Church), Turing's later work, and the birth of the modern computer.

In the paper, "On Computable Numbers, with an Application to the Entscheidungsproblem," Turing thinks carefully about how humans perform computation, breaking it down into a sequence of steps, and then constructs theoretical machines capable of performing each step. Turing wanted to show that there were problems that were beyond any computer's ability to solve; in particular, he wanted to find a decision problem that he could prove was undecidable. To explain Turing's ideas, Bernhardt examines three well-known decision problems to explore the concept of undecidability; investigates theoretical computing machines, including Turing machines; explains universal machines; and proves that certain problems are undecidable, including Turing's problem concerning computable numbers.

Citeste mai mult

Detaliile produsului

De pe acelasi raft

Parerea ta e inspiratie pentru comunitatea Libris!

Noi suntem despre carti, si la fel este si

Newsletter-ul nostru.

Aboneaza-te la vestile literare si primesti un cupon de -10% pentru viitoarea ta comanda!

*Reducerea aplicata prin cupon nu se cumuleaza, ci se aplica reducerea cea mai mare.

Ma abonez image one
Ma abonez image one