Turing machine and V Neumann architecture (do-over)

Turing machines as concept block

Hi! today I wanna talk about what my classmates and I were talking in our last class and that was: what is a Turing machine? and how does it works?, we watched a few videos of how Turing machines and CPUs work. We leaned that a Turing machine is an abstract model of computer execution and storage introduced in 1936 by Alan Turing to give a mathematically precise definition of algorithm or 'mechanical procedure'. As such it is still widely used in theoretical computer science, especially in complexity theory and the theory of computation.

Now I´m gonna try to explain it

• First I I created a mind map about this machines and V Neumann , with the program ¨Mindomo¨ that we learn how to use it in class,this mindmap was really usefull so we organize all that we learned, I will paste the link here so you can see it

To say it in simple words is an A Turing machine is a hypothetical machine, it can simulate ANY computer algorithm, no matter how complicated it is.

 It consists of an infinitely-long tape which acts like the memory in a typical computer. The squares on the tape are usually blank at the start and can be written with symbols, in this case, the machine can only process the symbols 0 and 1.