1 / 17

Exploring Turing Machines: How They Think and Process Data

Discover the functioning of Turing Machines through examples and rules, showcasing their ability to process data effectively. Witness how Turing Machines transform binary representations and derive successors efficiently. Dive into the world of computation and logic brought to life by these fascinating machines.

miriam
Télécharger la présentation

Exploring Turing Machines: How They Think and Process Data

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. How Does Turing Machine Think? ExampleChaoyang Li RULE’S If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT! Let’s see how they are carried out on a piece of paper that contains 111101:

  2. Turing Machine-A Thinking Machine If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  3. Turing Machine-A Thinking Machine If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  4. If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  5. If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  6. Turing Machine-A Thinking Machine If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  7. Turing Machine-A Thinking Machine If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  8. So the successor’s output on 111101 was 000011 which is the reverse binary representation of 111101. Similarly, the successor of 127 should be 128:

  9. Turing Machine-A Thinking Machine If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  10. If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  11. If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  12. If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  13. If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  14. If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  15. If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  16. If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT!

  17. If read 1, write 0, go right, repeat. If read 0, write 1, HALT! If read , write 1, HALT! So the successor’s output on 1111111 was 10000000 which is the reverse binary representation of 1111111.

More Related