Комментарии:
GOTO WHERE YOU ❤
ОтветитьI've been in this game since 1976, and have never needed to know what Turing Complete means. And I'm still none the wiser.
"Turing Complete" is a recent term, I've only ever heard it mentioned in the past decade or so. And as far as I can tell, these kinds of arbitrary definitions are something for computer scientists in academia to put on their exam tests, but have little if any practical value in the real world. The same as the Chomsky hierarchy, and even, dare I suggest, the ISO/OSI network model, for example. Nebulous and abstract definitions are completely irrelevant when you're a software engineer designing and implementing with hard requirements.
Godels incompleteness and Turing completion makes me think Sir Roger Penrose conformal cyclical Cosmology is actually true
ОтветитьSo as human we are not Turing complete since we do not have an infinite memory ?
ОтветитьThank you sir
Ответитьif it's Turing complete it can run Doom
ОтветитьDaniel Katz
ОтветитьThe reality is turing complete.
ОтветитьI hate the assembly language, its so bad
ОтветитьDoesn’t explain anything
Ответить🌹🌹🌹🌹👌
Ответить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.
ОтветитьIs there a set of steps to proof turing completeness?
ОтветитьWhat I carried out from this video is that a Turing-complete machine must be able to:
- have memory divided into cells where it can store instructions and data
- read from and write to the memory
- jump to any cell conditionally
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...
Ответитьsingle instruction set computing
the SUBLEQ instruction
subtract A - B, store to A, if result is less than or equal to, branch to C
this guy is awesome
ОтветитьO
ОтветитьNever knew David Attenbruh taught cs
ОтветитьHe appears to be a sinophile. There is a case of mooncakes left on the storage, probably eaten but he kept the packaging!
ОтветитьPlease use a ball-point pen....please!
ОтветитьI wonder if in some cases the programming language can determine the hardware engineering and if in other cases the hardware engineering determine the programming language. If both ways are possible are their limitations and advantages.
ОтветитьI heard some people say that Baba is You, a game about changing the rules, is Turing Complete.
ОтветитьI wish I had some classes with this teacher. Damn
ОтветитьHis reaction to, "none of our computers are Turing machines" was really effing delightful.
Ответить👍
ОтветитьYou just explained recursion - a turing complete lang must be able to do anything a turing machine can do
Ответить"You must have an arbitrary amount of memory" he says as he runs out of paper.
Ответитьmark wiens
ОтветитьHe looks exactly like Charles Babbage
ОтветитьIf you include the demand for infinite memory into turing completeness then turing completeness means nothing. NOTHING in real life is ever infinite.
ОтветитьThe David Attenborough of computer science
ОтветитьI watched this and learned nothing.
Ответитьironically, you're using what look like html tags in your graphics as dude mentions all the programming languages that are turing complete -- html is not, if you consider it a language (which it really isnt)
Ответить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.
Thanks for making
ОтветитьI just love him.
Ответитьwrg
Ответитьmy microwave is Turing complete.
i can input anything and it will return an answer
How about church complete.
Ответитьparallel, series ,inverter.
ОтветитьPowerpoint is turing complete
Let that sink in
This is the ideal male body. You may not like it, but this is what peak performance looks like.
ОтветитьBrainf**k is probably the simplest Turing complete language
ОтветитьCame here the first time because of school. Now I'm back because of Ethereum!
ОтветитьPowerpoint is also turing complete
Ответитьmentions Babbage and forgets Ada Lovelace
ОтветитьWow!!! Infinite memory? Why would you need that? If you need infinite memory most likely the outcome is undefined. The process will never end therefore no outcome. I do not think it has meaning in the physical world.
Ответить