|
|
|
|
|
by dhatch387
3492 days ago
|
|
A programming language "is said to be Turing complete or computationally universal if it can be used to simulate any single-taped Turing machine" [1]. This author doesn't seem to understand this concept properly. [1] https://en.wikipedia.org/wiki/Turing_completeness |
|