|
|
|
|
|
|
by lisper
723 days ago
|
|
|
> Circular programs in Turing's language are those that return to some exact earlier state No, they aren't. They are programs that print a finite number of "symbols of the first kind" i.e. 0s and 1s. They can print an infinite number of other symbols. You might want to check out this branch of the discussion: https://news.ycombinator.com/item?id=40855382 |
|
|