jokes

[Dan]

bugzpodder wrote:

how about a for loop? how about a recursive call??
http://en.wikipedia.org/wiki/Halting_problem

well if the for loops conditon is unreaable by the 3rd fact ie:

for(int i = 0; i == -1; i++)

then it is an inf loop

or if the for loop is

for(;

it is a inf loop.


i am just saying it is posable to tell in some cases.

[Delos]

Let's see if I remember this...no I don't. Damn. Ah well, the proof is based on a few things:

- for the proggie to tell whether the test proggie will halt, it has to either analyse the lines or run portions of them.
- if a proggie theoretically is able to test for halting, then the proof says to copy that proggie, change a few things, then run the original on itself, or something to that effect...and it will not spot/find the halting. It made sense when they were explaining it (where 'they' == a prof. from UofT speaking about some CompSci related issue [Computing Insights 2003]).

[bugzpodder]

that guy with a funny accent?? yeah I was there.... wasted a thousand bucks... could've used a new computer instead. if you still have the collection of photos, go through it and find the one that you cant make out, and that would be me. (maybe that isnt even a picture of me )