APBeaver, An unaccelerated turing machine simulator. Can prove that certain turing machines eventually reach a halt state given enough time. This time may range from a few miliseconds to trillions of billions of years. I made it by making a turing machine tape out of a large array of integers, and tracking its head position as it moves across the tape. I also made a parser for ease of use.
APBeaver, An unaccelerated turing machine simulator. Can prove that certain turing machines eventually reach a halt state given enough time. This time may range from a few miliseconds to trillions of billions of years. I made it by making a turing machine tape out of a large array of integers, and tracking its head position as it moves across the tape. I also made a parser for ease of use.