Y
Hacker News
new
|
ask
|
show
|
jobs
by
pygy_
3550 days ago
Turing completeness requires infinite discrete time steps and memory.