|
|
|
|
|
|
by dllthomas
4520 days ago
|
|
|
"CSS is still under debate for being turing complete" So far as I'm aware, that's not the case. CSS is not Turing complete, in terms of what it can calculate in a single calculation. It is Turing complete if you string those calculations together, feeding the output of the last into the input of the next, which can only be done with some external source of events, but that is a larger system than "CSS". A UTM run for up to 1000 steps is not Turing complete. Turing completeness is arguably a bug, not a feature, when the goal is producing something quickly. |
|
|