[Imc-makerspace] MakerspaceU -> Add Story

[Stewart Dickson]

Ah, Grasshopper.   That question is undecidable.     
http://en.wikipedia.org/wiki/Halting_problem
That is the question of whether an infinite-loop (or infinite recursion, 
given infinite stack) can be software-detected.
>  The halting problem is undecidable over Turing machines.
-Stewart

wabyarlay at gmail.com wrote:
> when will the MADNESS END!?!? hehehe
...

-- 
This message has been scanned for viruses and
dangerous content by MailScanner, and is
believed to be clean.