3 ms·
A Proof of the Halting Problem's Undecidability in Verse
- Dilpil 18y agoAn interesting side note: many people greatly inflate the halting problem. My software engineering professor for example, has stated that it is impossible to prove a program will halt by formal verification. The truth is, while it is impossible to write a general solution to the halting problem, there are a great many subcases where it is possible.
- Darmani 18y agoI initially thought this was supposed to be a rap, and read it as such -- it worked well. I then read the text at the bottom. That creates a scary thought: can Dr. Seuss books be rapped verbatim? (This is making a rapped version of "I am the Lorax. I speak for the trees" going through my head.)
- technoguyrob 18y agoSing this out loud in a low voice...awesome.