Is this true of interpreters?https://twitter.com/Ngnghm/status/1014672209250603009 …
-
-
Replying to @pigworker
An interpreter is a program like others. For all source codes, all inputs and all max running times, see if the program's output for the input within the time matches the code's input. After finite time, you'll rule out all code simpler than one that is correct.
1 reply 0 retweets 1 like -
Replying to @Ngnghm @pigworker
Of course, a finite time might be quite large. And you may never know for sure *when* to stop. But after a finite time, you *will* have a correct solution. Now, from that theoretical result to a practical application, there is a large gap.
2 replies 0 retweets 1 like -
Replying to @Ngnghm
"and you may never know when to stop" does not qualify constructively as "finite time"
2 replies 0 retweets 0 likes -
Replying to @pigworker @Ngnghm
A finite time exists, but you don't know what it is; seems reasonable to me.
1 reply 0 retweets 1 like -
And yet, humans use Induction all the time. That's how kids learn to use their body, walk and talk. And how some computer scientists grow their sense of aesthetics that make them cringe at the idea.
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.
Read my blog!