Section 1 and 4
Hi! today I wanna talk about what my classmates and I were talking in our last informatic class and that was: what is a Turing machine? and how does it works?.
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.
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.
Section 2 and 3
No comments:
Post a Comment