Re:JPEG XL would be Turing-complete without the 1024×1024 pi...
by hajile on Wednesday June 23, 2021 @01:30PM
(#27607305)
The halting problem can exist in bounded memory. A jump instruction that jumps to itself would be the most simple example.
[ Parent
| on HN ]
Re:JPEG XL would be Turing-complete without the 1024×1024 pi...
by sp332 on Wednesday June 23, 2021 @04:15PM
(#27609636)
The halting problem is to analyze a program and decide whether it will halt after a finite number of steps, or run forever. Your program is trivial to analyze. https://cs.wellesley.edu/~cs251/f20/notes/halt.html#the-halt...