HNGlance

Top Best New Show

A Proof of the Halting Problem's Undecidability in Verse

http://ling.ed.ac.uk/~gpullum/loopsnoop.html

by soundsop • 18 years ago

12 3 18 years ago

LI

Related Stories

Loading related stories...

Comments

3

Dilpil• 18 years ago

An 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• 18 years ago

I 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• 18 years ago

Sing this out loud in a low voice...awesome.

Source preview

ling.ed.ac.uk

HNGlance

© 2024-2026 HN Glance. Story content belongs to its original sources.

Privacy
Terms