Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
waynecochran
on April 11, 2020
|
parent
|
context
|
favorite
| on:
Surprisingly Turing-Complete
Turing Complete is not a very high bar. Add a second stack to a pushdown automata and its Turing Complete. Add two counters to a NFA and it’s Turing Complete. I don’t think folks know what this means.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
