Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
ivanbakel
on Jan 15, 2021
|
parent
|
context
|
favorite
| on:
CSS Turing Machine
Could you please give a reference for such a model, and the proof that it's Turing complete? I don't see it described on the Wikipedia page, which explicitly states that registers are unbounded.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: