Crash Course Computer Science #15 - Alan Turing

This video focuses on the father of computer science

• Alan Turing

• John von Neumann

• Charless Babbage

• George Boole

Turing's first brush with computer science came in 1935 while he was a master's student at...

• Queen's College in New York

• King's College in Cambridge

• Bishop's School of London

• the Royal Academy of Oxford

The ​ (a)   problem asked the following:

Is there an ​ (b)   that takes a statement written in formal ​ (c)   and produces a "yes" or "no" answer that's always accurate?

• algorithm
• decision
• logic
• code
• function

Who presented a solution to the decision problem in 1935 with lambda calculus?

• Alonzo Church

• Grace Hopper

• Alan Turing

• George Boole

Turing Machines provided a simple, yet powerful mathematical ​ (a)   of computation. Although using totally different mathematics, they were functionally ​ (b)   to lambda calculus in terms of their computational ​ (c)   .

• model
• equivalent
• power
• equations
• superior

A Turing Machine is a theoretical computing device equipped with what things?

• infinity long memory tape

• read/write head

• state variable

• a set of rules

In the example of a Turing Machine, what will happen if the state is ODD and the current symbol is 1?

Pick 2

• change the state to even

• keep the state odd

• move the head to the right

• write a 1

• write a 0

A modern computer that is as powerful as the turing machine is called...

• turing equivalent

• turing complete

• turing-like

• turing compatible

The ​ (a)   asks:

"Is there an ​ (b)   that can determine, given a description of a ​ (c)   and the input from its tape, whether the machine with ​ (d)   or halt?"

• Halting Problem
• algorithm
• Turing Machine
• run forever

If the hypothetical "Bizarro" machine was given an input of itself, what output will it give?

• YES - runs forever

• NO - will halt

• there is no answer