TM 1.0 by Zero5556

Zero5556

13 / 0

16th May 2023

21st May 2023

This is one of the types of Turing machine, it has only 2 symbols, maximum 4 states and limited tape, and this machine can run any algorithms if it has enough memory tape and symbols.

turing machine computer busy beaver

Comments

• 

  Zero5556 21st May 2023
  tptQuantification: Actually my Turing machine works by enabling wifi, currently there are 6 wifi channels and 5 of them are used to execute commands and I just do those things automatically.
• 

  Zero5556 21st May 2023
  tptQuantification: I'm busy right now so I'll be doing a coding tutorial in a few days.
• 

  tptQuantification 20th May 2023
  +1 goood. Could you make a coding tutorial?
• 

  Zero5556 18th May 2023
  i haven't seen a Turing machine in TPT running the busy beaver problem so i make one of my own.
• 

  micque 17th May 2023
  very nice! +1!