by Ciro Santilli (@cirosantilli, 37)
Non formal proof with a program March 2023: www.sligocki.com/2023/03/13/skelet-1-infinite.html Awesome article that describes the proof procedure.
The proof uses Turing machine acceleration to show that Skelet machine #1 is a Translated cycler Turing machine with humongous cycle paramters:
  • start between 50-200 M steps, not calculated precisely on the original post
  • period: ~8 billion steps

Ancestors (15)

  1. Skelet machine #1
  2. Skelet’s machines
  3. BB(5)
  4. Specific values of the Busy beaver function
  5. Busy beaver function
  6. Busy beaver
  7. Halting problem
  8. Decision problem
  9. Computational problem
  10. Computer science
  11. Computer
  12. Information technology
  13. Area of technology
  14. Technology
  15. Home

View article source

Discussion (0)

+ New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic + Create my own version