|
|
|
|
|
|
by skissane
1883 days ago
|
|
|
> How does a simple Python program, that one cannot determine whether it halts or not, look? The halting problem is actually theoretically decidable for real world programming languages such as Python. That's because in the real world, computers have finite memory, and the halting problem actually decidable for machines with finite memory (linear bounded automata). Not practically decidable – if a program consumes 1MB of RAM, then (in the general case) solving the halting problem for it will take approximately 2^1048576 steps, which is much longer than the age of the universe. |
|
|