Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
contravariant
on Sept 10, 2022
|
parent
|
context
|
favorite
| on:
Python type hints are Turing complete
Unless you allow unbounded input there is
technically
a limit to the amount of memory an N-state Turing machine could possibly allocate (and still halt).
Filligree
on Sept 10, 2022
|
next
[–]
Although we don't know what that limit is, and I believe it's uncomputable.
asddubs
on Sept 10, 2022
|
prev
[–]
yes, but for any given real machine with a memory limit, i can come up with a turing machine it can't simulate
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
