Comment by jtwaleson
2 months ago
There should be a language that uses "Almost-In-Time" compilation. If it runs out of time, it just gives a random answer.
2 months ago
There should be a language that uses "Almost-In-Time" compilation. If it runs out of time, it just gives a random answer.
"Progressive compilation" would be more fun: The compiler has a candidate output ready at all times, starting from a random program that progressively gets refined into what the source code says. Like progressive JPEG.
Best I can do is a system that gives you a random answer no matter how much time you give it.
Great! 80-20, Pareto principle, we're gonna use that! We are as good as done with the task. Everyone take phinnaeus as an example. This is how you get things done. We move quickly and break things. Remember our motto.
Break things and run away, got it.
1 reply →
This might be a similar but possibly more sensible approach? -> https://en.wikipedia.org/wiki/Anytime_algorithm
Yes, the way I described it is actually a sensible approach to some problems.
"Almost-in-time compilation" is mostly an extremely funny name I came up with, and I've trying to figure out the funniest "explanation" for it for years. So far the "it prints a random answer" is the most catchy one, but I have the feeling there are better ones out there.
When you get the wrong answer you can just say 'ah yes, the halting problem'
You should send a pull request to DreamBerd/Gulf of Mexico[0], it's surely the only language that can handle it properly!
[0]https://github.com/TodePond/GulfOfMexico
Hilarious. I will actually do that :)
Soft real time systems often work like that. "Can't complete in time, best I can do is X".
AIighT