2 ms·
Strictly speaking real computers are finite state machines and are trivially decidable from the halting problem point of view. The problem is that it just takes
by fpoling 7y ago
Strictly speaking real computers are finite state machines and are trivially decidable from the halting problem point of view. The problem is that it just takes long long time.
- h91wka 7y agoThis argument has been risen and dismissed in this thread already, no need to repeat.