 |
COMPGROUPS.NET |
 Search |
 Post Question |
 Groups |
 Stream |
 About |
 Register
|
Stats Updating... 5/24/2013 8:49:45 AM Top Users in comp.theory  amgsolo (957) 957 Articles, 0 Replies, 957 Points
 xanthian (647) 47 Articles, 600 Replies, 647 Points
 marty.musatov (1142) 407 Articles, 734 Replies, 1142 Points
 cplxphil (226) 41 Articles, 185 Replies, 226 Points
 see80 (282) 7 Articles, 275 Replies, 282 Points
 pats (3215) 20 Articles, 3195 Replies, 3215 Points
 p.black (250) 14 Articles, 236 Replies, 250 Points
 logiclab (185) 42 Articles, 143 Replies, 185 Points
 tchow (869) 6 Articles, 863 Replies, 869 Points
 rdecker (166) 4 Articles, 162 Replies, 166 Points
Top Articles in comp.theory  Disproof of the Halting Problem's Conclusion  333
 58 (7/13/2004 11:31:58 PM) Most recently updated version of this informal proof will be posted on this link: http://home.att.net/~olcott/halts.html The goal of this proof is to refute the Halting Problem's conclusion: (paraphrase) {It i...   olcott (139) Yet another Attempt at Disproving the Halting Problem 352
49 (7/26/2004 2:55:13 AM) www.halting-problem.com This is just to get on record as this idea's originator. This posting will probably be the one that is the least clear. My goal is to translate these ideas into a direct frontal attack ...  olcott1 (1189) Can a regular Turing Machine provide Protected Memory? 287
51 (8/27/2004 12:13:51 PM) It would seem that a regular Turing Machine would be able to provide protected memory. If we cast the problem as a regular TM that was designed as a UTM, it would seem to be able to provide Protected Memory Ser... olcott1 (1189) THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false? 377
76 (1/9/2005 4:44:53 AM) We know "this statement has no proof in system X" is true in system X and provable in system Y. But what if you could formulate a forall quantifier over systems? Is the meta-godel statement true? Herc -...  erc A Possible "solution" to the Halting Problem 360
35 (10/15/2006 2:19:52 PM) The Halt program throws an "Invalid Input" exception. This would be analogous to the hardware exception of an attempt to divide by zero. ...  NoSpam266 (463) Diagonal wanderings (incongruent by construction) 1003
64 (5/7/2009 12:04:15 AM) Mostly, a thought experiment: Cantor claims: "whichever list of infinite (binary) strings you can come up with, I will (anti-)diagonalise it." It is (AFAIK) easy enough to come up with a production of _all_ t...  julio (505) Most Natural Numbers Are Uncomputable 408
41 (7/15/2009 5:05:13 AM) I prove most natural numbers are so large even an "infinitely" fast computer can not read or write these numbers. First, I will describe a simple set theory problem and then I show how this problem is related ...  reasterly (337) A Guide for Cantor Cranks 312
57 (3/10/2011 7:03:50 AM) Why create another refutation of Cantor when there are so many known refutations available? These are three tried and true arguments to debunk Cantor's Anti-Diagonal proof. 1) Prove the anti-diagonal number is... reasterly (337) Sketch of a Disproof of Rice's Theorem 454
80 (3/28/2012 12:03:48 AM) Continuation of "Pathological Self-Reference and the Halting Problem" Paraphrase from page 237 of Dexter Kozen's 1997 Automata and Computability His example proves that a TM that accepts the empty string is ...  NoSpam271 (937) The Halting Problem is based on an ill-formed Question 523
57 (6/9/2012 1:43:58 AM) If a yes or no question does not have a correct yes or no answer then there must be something wrong with this question. More generally: An ill-formed question is defined as any question that lacks a corre... PeterStatistics Last Updated: 4/27/2013 12:00:00 AM |
5 followers. 