Turing Complete - Computerphile

What does it mean for something to be Turing Complete? Professor Brailsford explains.

This video was filmed and edited by Sean Riley.

[AvielMenter]

"The usual suspects: Fortran, Basic, Pascal, Cobol". Professor Brasilford is really showing his age there; it's great.

[ashwith]

I've probably said this before but the animations are extremely helpful in understanding what is being explained!

[dpommoqb]

I love truly enthusiastic teachers, they make everything so much more interesting.

[freemanaccount]

I want to just sit next this guy and listen to whatever he ramble about. I dont take up much space, and I smell nice...

[NickCybert]

5:25 That's look of a teacher who's is relieved to see his student finally learning something after how many Professor Brailsford videos has it been now? Nice work Sean.

[jeremiahglover]

"You must have an arbitrary amount of memory" he says as he runs out of paper.

[InkDevil]

For those interested in how computers work there is a game called Turning Complete where you learn about different gates, registers, bits/bytes, busses and others. It is possible to make a whole computer in the game from the ground up. I know some people have build Intel CPUs or Tetris and Snake on a computer they themselves have built.

[srgio]

It's crazy how simple is to understand these concepts with this video. Congratulations.

[conkerconk]

Literally got emotional for some reason, as soon as i saw Conway's game of life being played on Conway's game of life, using something called an OTCA Metapixel...

[ianknight]

I was always taught a TM has an 'unbounded' tape, not an infinite tape, whereby your tape is finite length but you can always add another bit to it whenever needed. The point is that at any individual point in time, an unbounded tape will have finite length.

[vadymdmitrievich]

Babbage was a great computer scientist.
But I think that Turing was the first one, who broke through classical "only mechanical" type of computing machine, and made first (in theory) true cyberphysical computing machine.

[wheedler]

I've seen this explained a few times, but this is the first time I think I've actually understood.

[kgothatsontsane]

Wow, this is great. In all my years I have never understood something so easily.

[metacustomcomputers]

GOTO, or "How to spaghettify your code". :)

Kind regards,
Meta Custom Computers

[realshaoran]

Nice video. But when Professor Brailsford mentioned Charles Babbage, I hoped he mentioned Lady Ada Lovelace as well, but he didn't :(

[foldr]

It would be nice if this video discussed the advantages and disadvantages of Turing-complete systems. Right now it's not much more than a recap of Turing machines.

[PvblivsAelivs]

Strictly speaking, of course, every computer we have is a finite-state machine. They go from one state to the next by means of electrical signals (including clock pulses) coming in. Computers are not normally _thought of_ as finite-state machines largely because it would be impractical to try to draw a state diagram. (There are more possible states than there are atoms in the known universe. But it is still a finite number.)

[subvind]

2:56 obviously pressing "j" jumps backwards on the tape, pressing "k" toggles it's state, and pressing "l" jumps forwards on the tape. Does that make this video(2:00) {youtube complete}?

[oafkad]

Babbage is one of my favorite names. So great.

[Thymesicle]

if it's Turing complete it can run Doom