jokes

bugzpodder · **Posted:** Wed Apr 28, 2004 6:50 pm

http://modernhumorist.com/mh/0107/turing/

Paul · **Posted:** Wed Apr 28, 2004 7:10 pm

Maverick · **Posted:** Wed Apr 28, 2004 8:26 pm

that supposed to be funny?

Raugrist · **Posted:** Wed Apr 28, 2004 8:45 pm

Are you familiar with computers Maverick? It might help.

Thanks for the link bugz, you've brightened my day. Well, night. OK, if it were day, that link would've brightened it.

Maverick · **Posted:** Wed Apr 28, 2004 8:54 pm

im familiar with computers but i see no humor in that

bugzpodder · **Posted:** Wed Apr 28, 2004 8:56 pm

I almost fell out of my chair when I read it. maybe they are not that funny to you, but do you *understand* the jokes at least?

Maverick · **Posted:** Wed Apr 28, 2004 9:56 pm

oh i understand them. lol i guess the last part is pretty funny. HELLO, HELLO

Dauntless · **Posted:** Wed Apr 28, 2004 11:12 pm

Quote:

MH: Are you a computer?
Dell: Nope.
MH: You’d be surprised how many fall for that one.

Word.

Raugrist · **Posted:** Thu Apr 29, 2004 6:42 am

Yes, that part right there was the greatest.

Tony · **Posted:** Thu Apr 29, 2004 10:40 am

Delos wrote:

BTW, don't start trying to make a programme to check for halting...it won't work...It's been proven...

do you have any documentation of such? I'd like to read the prove cuz for a program

code:

loop
put "hello world"
end loop

you can determine it will never end simply because it lacks loop's exit

Delos · **Posted:** Thu Apr 29, 2004 12:04 pm

I hope you guys understand the depth of humour in this article! And for those of you who don't (and just to show off a bit:D), here's a little tidbit of info you may want to know.

The last joke is especially funny as it is an example of an infinite loop. This programme does not end. Alan Turing himself (of whose fame the article was based) was the first to discover/prove that it is impossible to make a programme that can tell whether or not another programme will ever stop executing...i.e., will a given programme halt. This became known as the Halt Problem (hmm...Halt...Holt...). So, here we have a computer that cannot halt...ah, the hilarity...

BTW, don't start trying to make a programme to check for halting...it won't work...It's been proven...

bugzpodder · **Posted:** Thu Apr 29, 2004 1:18 pm

it is based on the principle that:
Let S represent the shortest lexicographical sentence that cannot be defined in twenty words or less. I just defined it using under twenty words.

Dan · **Posted:** Thu Apr 29, 2004 2:02 pm

Delos wrote:

BTW, don't start trying to make a programme to check for halting...it won't work...It's been proven...

if you where to check to see if your progame has goen back to the same line that it has all ready been to yet there have been no chages in meory (RAM) since then whould that not prove that it is a inf loop?

Think about it, if nothing has chaged in memory (no i/o at all to memory or other wises) and the progmae has come back to the same line more then once with out this chage then it whould be an inf loop.

this whould not chetch all inf loops but alot of them. there for it could not be proven that u can not check for all inf loops.

bugzpodder · **Posted:** Thu Apr 29, 2004 2:08 pm

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

Paul · **Posted:** Thu Apr 29, 2004 2:10 pm

The electricity part I found funny Laughing

	Computer Science Canada Programming C, C++, Java, PHP, Ruby, Turing, VB Username: Password: Register
Wiki Blog Search Turing Chat Room Members