6 ms·
Here's a Turing machine that uses finite space but infinite time: https://samwho.dev/christopher/?code=H4sIAAAAAAAAE8tNzMxTqFHQUqhRCNAw1FQIUtC1UyhKLSktyuOCUHBZA
by jakelazaroff 2y ago
Here's a Turing machine that uses finite space but infinite time: https://samwho.dev/christopher/?code=H4sIAAAAAAAAE8tNzMxTqFHQUqhRCNAw1FQIUtC1UyhKLSktyuOCUHBZA00FH5BsbmJmHgBlULd%2BNwAAAA%3D%3D https://samwho.dev/christopher/?code=H4sIAAAAAAAAE8tNzMxTqFH... (from Sam Rose's wonderful article on Turing machines [1])
Your last point is correct, though: if you can detect a "cycle" (like the one the Turing machine I linked to goes through) then you can conclude that the machine won't halt.
[1] https://samwho.dev/turing-machines/ https://samwho.dev/turing-machines/
- eru 2y agoYes, it's trivial to write a Turing machine that only uses finite space but infinite time. But as you agree, they are of no concern for the computability of Busy Beaver numbers. (However, they are of major concern for people who want to find Busy Beaver numbers in practice.)