Y
Hacker News
new
|
ask
|
show
|
jobs
by
gavinhoward
1153 days ago
You don't need an infinite list of functions to run into the problems with Turing-completeness. You only need
effectively
infinite
behavior
, which means all you need is effectively infinite possible inputs.
1 comments
throwawaymaths
1153 days ago
this is simply untrue. I'm sorry. I recommend studying math a bit more rigorously before making claims in the future.
link