Computer Science Canada jokes |
| Author: | bugzpodder [ Wed Apr 28, 2004 6:50 pm ] |
| Post subject: | jokes |
http://modernhumorist.com/mh/0107/turing/ |
|
| Author: | Paul [ Wed Apr 28, 2004 7:10 pm ] |
| Post subject: | |
|
|
|
| Author: | Maverick [ Wed Apr 28, 2004 8:26 pm ] |
| Post subject: | |
that supposed to be funny? |
|
| Author: | Raugrist [ Wed Apr 28, 2004 8:45 pm ] |
| Post subject: | |
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. |
|
| Author: | Maverick [ Wed Apr 28, 2004 8:54 pm ] |
| Post subject: | |
im familiar with computers but i see no humor in that |
|
| Author: | bugzpodder [ Wed Apr 28, 2004 8:56 pm ] |
| Post subject: | |
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? |
|
| Author: | Maverick [ Wed Apr 28, 2004 9:56 pm ] |
| Post subject: | |
oh i understand them. lol i guess the last part is pretty funny. HELLO, HELLO |
|
| Author: | Dauntless [ Wed Apr 28, 2004 11:12 pm ] |
| Post subject: | |
Quote: MH: Are you a computer?
Dell: Nope. MH: You’d be surprised how many fall for that one. Word. |
|
| Author: | Raugrist [ Thu Apr 29, 2004 6:42 am ] |
| Post subject: | |
Yes, that part right there was the greatest. |
|
| Author: | Tony [ Thu Apr 29, 2004 10:40 am ] | ||
| Post subject: | |||
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
you can determine it will never end simply because it lacks loop's exit |
|||
| Author: | Delos [ Thu Apr 29, 2004 12:04 pm ] |
| Post subject: | |
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... |
|
| Author: | bugzpodder [ Thu Apr 29, 2004 1:18 pm ] |
| Post subject: | |
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. |
|
| Author: | Dan [ Thu Apr 29, 2004 2:02 pm ] |
| Post subject: | |
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. |
|
| Author: | bugzpodder [ Thu Apr 29, 2004 2:08 pm ] |
| Post subject: | |
how about a for loop? how about a recursive call?? http://en.wikipedia.org/wiki/Halting_problem |
|
| Author: | Paul [ Thu Apr 29, 2004 2:10 pm ] |
| Post subject: | |
The electricity part I found funny |
|
| Author: | Dan [ Thu Apr 29, 2004 7:34 pm ] |
| Post subject: | |
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. |
|
| Author: | Delos [ Fri Apr 30, 2004 4:20 pm ] |
| Post subject: | |
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]). |
|
| Author: | bugzpodder [ Fri Apr 30, 2004 7:39 pm ] |
| Post subject: | |
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 ) |
|