Not even a Turing machine can calculate how oversized that V-neck is

Comments section: 1%: nice video 99%: V-neck

I like Professor Jago's style when dealing with very high-level computing concepts: he takes it slow, gives us enough time to absorb what he's said, and speaks with as plain a wording as possible. Perfect for this kind of thing.

turing was truly a remarkable genius. he didn't have the life he deserved...

Is it just me or this professor has a built-in real time script writer in his brain. His speech is perfect!

I'm so distracted by how deep his v neck is

Damn that V-neck tho

I wish my teachers were more like Mark! He puts pauses of the perfect length in the perfect spots such that you have just enough time to absorb what he just said, but not enough time for your mind to wander in the empty space.

LOL, "A Quantum Computer can do it more efficiently but don't ask me how"

He speaks like he's about to sneeze.

Amazing crash course on the Alan Turing machine. I just started a new class this week (discrete math). One of the discussion topics asked to describe what a turing machine is and its purpose in the computer science world today. I honestly, watched about 4 other videos on the topic, only to be more confused about its description and functions. Luckily, i'm standing in this legendary checkout line at Burlington coat factory and decided to give this UKposts tutorial another go. I'm nowhere near 100% sure what the machine does and how it works but I get the gist of it now.. Thank you for your explanation.

I really like the way Professor Mark Jago explains the Turing machine. It really helped me with my essay. Thanks!

One abstraction that could be mentioned is that you can have more tape symbols than just "0" and "1" as demonstrated here. Makes it easier to understand a lot of Turing machines because you don't need to have as many states.

5:00 How?

I love your way of presenting very complex information! Without it, I wouldn't be able to explain it to my friends 😋

The clarity of this video was Turing Complete. Bravo! And thank you

This should have been one of the first videos. Great explanation by the way.

Well put description of computer science as it is. I like this new guy. Not distracted by his attire, I live in NJ and see this at the gym all the time.

Sharp and concise. It was a fine (short) class, thank you very much Professor Jago!

Good video. And Brady is a really good cameraman and editor.

I dont know why, but I like this guy and his way to explain things.

Imagine a big company with a lot of employees. At the beginning of the day, the boss prepares the two stacks of cards, either black or white in a lonely cubicle. He then calls over a specific employee to the cubicle, he leaves and waits to be called back. Each employee has a specific job when encountering the two stacks of cards. They check which card is on top of the right stack, and solely based on its color does three things: They replace the top card of the right stack with a card of his own. Then they move (or don't move) the top card of one of the stacks to the other stack. Then they call another specific member of the company over (possibly the boss) and leaves the room. Remember that what the employee does is only based on the card he saw, so each employee has two sets of three instructions. When some employee calls over the boss (as his instruction), the work is finished and the boss checks the result. In this analogy, the employees form the program, the boss is the user of the computer and the stacks of cards is the input, memory and output of the computer. By giving the employees specific instructions, the boss can have them calculate anything that is (Turing-)computable.

Anyone also notice the similarity of a animal cell to a turing machine? "A way of writing information in a coded form" - DNA Reading the tape - Transcription Table of instructions - amino acids synthesis.

lol that little animated Turing machine is so cute.

This is very interesting. I've learned a lot more about programming languages through this.

I needed this video! Good job Mark, thanks.

I can tell you how a quantum computer is more efficient. The goal of a Turing machine is to transform one configuration to another based on data gathered through observing the original configuration. If the bits (or qubits in the case of quantum though you can use quantum states of any dimension to build a computer ) are highly correlated (entangled) such that measuring one qubit gives you immediate information about another, one can use this information to modify the process with which one completes the transformation. This has the capacity to be more efficient since one gains more information about the system from each observation.

Can we have an episode on genetic algorithms and/or on neural networks please? That would be a super interesting video.

This simple explanation might've just saved me, will update this soon :)

Thanks a lot for making this video! Very simplified!

Awesome. I enjoyed the simple explanation of turning machine

I am glad i found this channel prof ,thanks.

I love it. easy to follow video and I get a general understanding of the topic

Very clear explanation, thank you) Would love to listen one about Lisp Machine

I FINALLY GET IT! Thank you! After reading and watching 5 explanations!

Excellent. Thanks. I've been trying to understand this in Richard Penrose's chapter in his book "The Emperor's New Mind". Trying to understand with very (very) little success. I'm curious as to how much this is due to Penrose's ability to explain to those who ain't so clever and to how much it is to do with the media of instruction. Certainly, I have watched this and am now beginning to understand.

But can it run Crysis?

Two concepts today that I thought were some sort of voodoo magic and come to find I've known these concepts for years in programming. (Lambda Calculus and Turing Machines) Thank you so much for making this topic approachable. When written as text, on Wikipedia for example, it was too difficult for this guy to get his head around:)

this was so incredibly helpful!

Finally some useful peice of British education! Been fed up rewinding MIT lectures. Geronimo!

I'm gonna watch this 20 more times so that in 5 days I'll be able to ... kind of.... explain this. Cheers!

The noise when the Turing box drops the 1 cracks me up. Like dropping a log into a metal bucket.

that visualisation (1:58) was really helpful, thanks :)

Stupendously explained.. Many thanks!!

One of the best explanations

can you guys do a video on quantum computing? is that within the field of computer science at most universities, or physics?

2:55 What is left on the tape is the answer to our problem 1:42 Each box codes up a question or problem that we want solved Is each box a seperate problem or/and question or is the whole tape one question/problem?

Illuminati machine

Can the Universe do anything that a Turing machine cannot? There's your next video, Brady!!

Thank you so much that was really helpful!

i liked how he speaks slowly

Very nicely explained! Thank you

Awesome explanation.

This is such a good video. Thank you :).

That's awesome! Something about Lambda Calculus or maybe even a continuation of the video Programming Paradigms on Functional Porgramming would be veery cool :)

Nice simple explanation!

This is good, thank you! I have seen a working Turing computer in Berlin, but I still struggled to understand it. Even though that should be the most basic thing:)

Can Computerphile do a video explaining the concept of quantum computers more in depth? I have heard of them, but do not fully understand the idea. It would be fascinating to learn about them more in-depth.

i was wondering what would be a turing complete be. thank you.

Epic William Shatner pauses..

This man should be an actor. He is very expressive

I wanna know how? When you say the computer has to look through every entry, and you say a quantum computer can do it more efficiently? Do you simply mean it can do it faster cause it has more processing power(More states maybe?)...or is there some quantum phenomenon that allows you to search a list with a worst case < n?

I watched it before and feel that i understand it years ago. I watch it again, Now i can comprehend it a little what he's talking about.

That is the cutest darn machine I've ever seen. Bill Cipher would be proud.

I loved the "hopefully" thrown out that way at 2:47 :D

Mark Jago is very good explainer..

Is it just me or does he double-blink .-.

Thanks for explaining this.

An episode about quantum computers and how they work would be awesome.

Very simple explanation!

could you link to more info about quantum computers doing a lookup that wouldn't require looking up every entry? sounds very interesting

Churing?

Is assembly language what tells the reader to do?

great explanation, thanks!

Thank you so much for ur great talk❤

Not too long ago in late 2018 a couple of PhDs in computer science, published a paper which showed that, relative to an oracle, BQP was not contained in PH. That is to say that there are problems a quantum computer could solve that would take a classical computer an infinite amount of time. Doesn't that mean that quantum computers can do things Turing machines simply can't?

What causes a halting state? How is what is left the answer? I don't get how this decrypts anything? I know you are talking about how the machine works in general, but tying that to successful decryption would help a lot in understanding.

I was wondering how you could simulate memory without damaging the instruction tape. Would you have to make a new instruction card for each possible state the memory could be in? Because if so, even just a byte of data would require 2^8 cards/states. Is there a way to simplify that?

turing was such a genius and a true pioneer of the v neck

Nicely explained

I would love to learn more about quantum computers!

he was well ahead of his time and to think in a such machine also no one thought about this .

Great video!

Is it understood correctly, if we think of eye as the processor and the tape as the memory as per the modern computer architecture.

the phone book example is still blowing my mind

Thanks for the video!

didnt realise about the tshirt until i read the comments lol. i think it's a fantastic video.

Man , thanks a lot for explanation ... very nice

Will you do a video on quantum computers?

To be fair a normal computer can use tree data structure to look up the desired contact in the phone book which doesn't usually takes time to look up all the pages.

Thanks for the video.

It begs the question, if a turing machine could emulate itself, such that the instruction table was stored on the tape as well as the tape for this simulated machine, how many states would the turing machine need to be able to properly simulate? Would this vary depending on how many states the simulated turing machine has, or the size of the simulated turing machine's alpbabet?

Thank You Today I've learned how the most interesting theory works.

The limit of algorithms is in quantum physics. Even equations are solved equally. The algorithm is to check if there is an operation, and to do the opposite. In the correct order of operations.

Hey Computerphile - I wondered, could you tell us something about the game "Arimaa"? I don't know very much about the game itself, but apparently it was created by a computer engineer with the intention of having simple rules, but making it nearly impossible for a computer to play it well.

"Don't ask me how" really had me cracking up.

What do you mean when you say a program is turing complete? I always thought it was the computer that replicated the turing machine, or even the programming language. If programs are algorithms does this mean any algorithm that reads, writes, conditional branches and loops is turing complete?

thanku ........... plz make more video on what deterministic, non-deterministic means what is context free grammer ...... what is mean by deciadibility and non-deciadibilty ?????

This makes me want to go back to college and study computer engineering again.

He made a drastic makeover. I like it.