|
|
|
|
|
|
by sp332
4305 days ago
|
|
|
Langton's ant has no halting state. It can't halt. But you're right, that description doesn't leave any room for programs that run in a specific loop forever instead of making a highway. So that doesn't seem to be Turing-complete. |
|
|