Technically competent Software engineers can verify this haltingproblem proof refutation

By olcott on Tue Jun 21 21:38:56 2022

Latest reply by olcott on Sun Jun 26 15:53:49 2022

Re: Technically competent Software engineers can verify thishalting problem proof refutation [ truism ]

By Mr Flibble on Sat Jun 25 15:53:21 2022

Latest reply by Mr Flibble on Sun Jun 26 00:42:51 2022

Re: Technically competent Software engineers can verify this haltingproblem proof refutation [ tautology ]

By olcott on Fri Jun 24 17:58:22 2022

Latest reply by Richard Damon on Sat Jun 25 21:47:48 2022

Re: Technically competent Software engineers can verify thishalting problem proof refutation [ tautology ]

By Mr Flibble on Sat Jun 25 20:18:52 2022

Latest reply by Mr Flibble on Sat Jun 25 20:33:33 2022

Re: Technically competent Software engineers can verify this haltingproblem proof refutation [ truism ]

By olcott on Wed Jun 22 17:22:47 2022

Latest reply by Richard Damon on Sat Jun 25 19:21:49 2022

Proving that H(P,P) is a correct P never reaches "ret" determiner (AKA P never halts)

By olcott on Thu Jun 23 20:48:18 2022

Latest reply by Mr Flibble on Sat Jun 25 15:55:54 2022

Re: Proving that H(P,P) is a correct P never reaches "ret" determiner [ strawman deception ]

By olcott on Sat Jun 25 10:14:53 2022

Latest reply by Richard Damon on Sat Jun 25 13:30:48 2022

Re: Technically competent Software engineers can verify this halting problem proof refutation [ truism ]

By olcott on Sat Jun 25 11:29:24 2022

Latest reply by olcott on Sat Jun 25 11:29:24 2022

=?UTF-8?Q?Re=3A_CARPEORO_=23CARPEORO_=C3=89_MASSONE_PEDOFILO=2C_DI_NDRAN?==?UTF-8?Q?GHETA=21_ED_ASSASSINO=21_SI=2C_=C3=89_PROPRIO_COS=C3=8D=3A_=C3=89_PEDERASTA_SATA?==?UTF-8?Q?NISTA_DI_NDRANGHETA=2C_IL_ROSACROCIANO_TEMPLARE_SANGUINARIO_ED?==?UTF-8?Q?_INCULA_BAMBINI_=23CARPEORO_CARPEORO_=28ALIAS_PEDOFILO_KILLER_DI?==?UTF-8?Q?_NDRANGHETA_GIANFRANCO?=

By Don Stockbauer on Fri Jun 10 21:45:01 2022

Latest reply by Don Stockbauer on Sat Jun 25 11:28:00 2022

Re: Software engineers [ not Flibble ] can verify this haltingproblem proof refutation [ full closure ]

By Mr Flibble on Thu Jun 23 20:59:44 2022

Latest reply by Mr Flibble on Thu Jun 23 20:59:44 2022

Re: Technically competent Software engineers can verify thishalting problem proof refutation [ full closure ]

By Mr Flibble on Thu Jun 23 20:41:53 2022

Latest reply by olcott on Thu Jun 23 14:56:26 2022

Re: Software engineers can verify this halting problem proofrefutation [ H(P,P) versus P(P) ]

By Richard Damon on Thu Jun 23 19:00:51 2022

Latest reply by Richard Damon on Thu Jun 23 19:00:51 2022

Software engineers can verify this halting problem proof refutation [H(P,P) versus P(P) ]

By olcott on Thu Jun 23 12:44:19 2022

Latest reply by olcott on Thu Jun 23 13:14:12 2022

Re: Technically competent Software engineers can verify thishalting problem proof refutation [ nitwit rebuttals ]

By Mr Flibble on Wed Jun 22 22:13:07 2022

Latest reply by Mr Flibble on Wed Jun 22 22:13:07 2022

Re: Technically competent Software engineers can verify this haltingproblem proof refutation [ strawman deception ]

By olcott on Wed Jun 22 12:58:44 2022

Latest reply by olcott on Wed Jun 22 19:34:01 2022

Re: Essence of the culmination five years of full time work on theHalting Problem [ strawman ]

By olcott on Tue Jun 21 20:54:56 2022

Latest reply by Richard Damon on Tue Jun 21 23:20:29 2022

Software engineers of extreme technical competence [ halting problemproof refutation ] V2

By olcott on Tue Jun 21 08:01:31 2022

Latest reply by Richard Damon on Tue Jun 21 22:50:12 2022

Software engineers of extremely high technical competence [ haltingproblem proof refutation ]

By olcott on Mon Jun 20 19:12:44 2022

Latest reply by Mr Flibble on Tue Jun 21 17:26:37 2022

Re: Software engineers of extremely high technical competence [ halting problem proof refutation ]

By olcott on Tue Jun 21 07:41:01 2022

Latest reply by olcott on Tue Jun 21 07:41:01 2022

Re: Essence of the culmination five years of full time work on theHalting Problem [ competence ]

By olcott on Mon Jun 20 13:52:18 2022

Latest reply by Richard Damon on Mon Jun 20 18:49:33 2022

Re: Halting Problem proof refutation is a tautology thus irrefutable[ liar or incompetent ]

By olcott on Sun Jun 19 16:17:20 2022

Latest reply by Richard Damon on Mon Jun 20 18:57:10 2022

Re: Halting Problem proof refutation is a tautology thusirrefutable [ technical competence ]

By Mr Flibble on Mon Jun 20 18:02:43 2022

Latest reply by Mr Flibble on Mon Jun 20 18:02:43 2022

Re: Essence of the culmination five years of full time work on theHalting Problem [ Edsger Dijkstra ]

By olcott on Mon Jun 20 13:41:55 2022

Latest reply by olcott on Mon Jun 20 13:41:55 2022

Re: Halting Problem proof refutation is a tautology thus irrefutable [ new criteria ]

By olcott on Sun Jun 19 13:30:22 2022

Latest reply by Richard Damon on Mon Jun 20 07:18:57 2022

Re: Halting Problem proof refutation is a tautology thusirrefutable [ liar or incompetent ]

By Mr Flibble on Sun Jun 19 22:20:01 2022

Latest reply by Mr Flibble on Mon Jun 20 00:49:57 2022

Re: Halting Problem proof refutation is a tautology thusirrefutable [ strawman ]

By Mr Flibble on Sun Jun 19 20:59:52 2022

Latest reply by Mr Flibble on Sun Jun 19 23:05:05 2022

Halting Problem proof refutation is a tautology thus irrefutable

By olcott on Sun Jun 19 10:13:00 2022

Latest reply by Richard Damon on Sun Jun 19 14:22:29 2022

H(P,P)==0 as a pure function of its inputs is fully operational

By olcott on Fri Jun 17 21:07:31 2022

Latest reply by Richard Damon on Sun Jun 19 14:36:40 2022

Re: Source-code of halt decider that decides the halting problem's "impossible" input [proxy rep]

By olcott on Sun Jun 19 09:33:18 2022

Latest reply by Richard Damon on Sun Jun 19 12:40:50 2022

Source-code of halt decider that decides the halting problem's"impossible" input

By olcott on Sat Jun 18 19:00:30 2022

Latest reply by olcott on Sat Jun 18 19:00:30 2022

=?UTF-8?Q?Re=3a_Reviewers_quit_reviewing_my_work_because_it_is_now_?==?UTF-8?B?ZmluYWxseSBpcnJlZnV0YWJsZSBbVjJdIC0tLSAoWCDiiKcgWSkg4oqiIFo=?=

By olcott on Sat Jun 18 08:19:50 2022

Latest reply by Richard Damon on Sat Jun 18 09:52:39 2022

Reviewers quit reviewing my work because it is now finallyirrefutable [V2]

By olcott on Fri Jun 17 06:29:29 2022

Latest reply by Richard Damon on Sat Jun 18 08:52:20 2022

Essence of the culmination five years of full time work on theHalting Problem

By olcott on Fri Jun 17 14:39:49 2022

Latest reply by Richard Damon on Fri Jun 17 20:50:41 2022

Re: Olcott's H

By olcott on Fri Jun 17 14:06:55 2022

Latest reply by Richard Damon on Fri Jun 17 20:45:56 2022

Re: Reviewers quit reviewing my work because it is now finally irrefutable [V2]

By olcott on Fri Jun 17 09:19:00 2022

Latest reply by olcott on Fri Jun 17 14:56:08 2022

Re: olcott, it's really simple [ succinct summation ]

By olcott on Thu Jun 16 20:06:09 2022

Latest reply by Richard Damon on Thu Jun 16 22:10:22 2022

Re: olcott, it's really simple

By olcott on Thu Jun 16 12:40:19 2022

Latest reply by Richard Damon on Thu Jun 16 22:08:23 2022

As easy as 1,2,3 H(P,P)==0 is proved to be correct

By olcott on Thu Jun 16 08:47:29 2022

Latest reply by Richard Damon on Thu Jun 16 18:47:23 2022

Criterion Measure of a simulating halt decider proving that H(P,P)==0

By olcott on Sun Jun 12 11:07:05 2022

Latest reply by Richard Damon on Thu Jun 16 18:45:33 2022

Re: olcott, it's really simple (tiny typo)

By olcott on Thu Jun 16 17:35:48 2022

Latest reply by olcott on Thu Jun 16 17:35:48 2022

Re: Criterion Measure of a simulating halt decider proving thatH(P,P)==0 [ criteria ]

By olcott on Wed Jun 15 18:48:33 2022

Latest reply by Richard Damon on Wed Jun 15 21:32:41 2022

Proving that H(P,P)==0 on the basis of easily verified facts

By olcott on Wed Jun 15 14:21:51 2022

Latest reply by Richard Damon on Wed Jun 15 18:51:01 2022

Proving that H(P,P)==0 on the basis of easily verified facts (tinytypos fixed)

By olcott on Wed Jun 15 17:44:47 2022

Latest reply by olcott on Wed Jun 15 17:44:47 2022

Re: Are my reviewers dishonest or technically incompetent ?

By olcott on Tue Jun 14 22:55:22 2022

Latest reply by Richard Damon on Wed Jun 15 06:40:21 2022

Re: Criterion Measure of a simulating halt decider proving thatH(P,P)==0 [DD]

By olcott on Tue Jun 14 10:00:55 2022

Latest reply by Richard Damon on Tue Jun 14 22:41:31 2022

Re: Criterion Measure of a simulating halt decider proving thatH(P,P)==0 [ false assumption ]

By olcott on Tue Jun 14 19:15:12 2022

Latest reply by olcott on Tue Jun 14 19:15:12 2022

Textbook Criterion measure for halt deciders is based on a falseassumption

By olcott on Mon Jun 13 18:12:49 2022

Latest reply by Richard Damon on Mon Jun 13 20:33:53 2022

Re: H(P,P) as a pure function of its inputs is easy [ source-codewill be available ]

By olcott on Sun Jun 12 15:30:47 2022

Latest reply by Richard Damon on Sun Jun 12 21:49:56 2022

Re: H(P,P) as a pure function of its inputs is easy [ psychotic breakfrom realty ]

By olcott on Sat Jun 11 16:22:35 2022

Latest reply by Richard Damon on Sat Jun 11 20:18:31 2022

Re: Proving that P(P) != the correct x86 emulation of the input toH(P,P)

By Mr Flibble on Fri Jun 10 18:25:59 2022

Latest reply by Richard Damon on Fri Jun 10 15:19:19 2022

Re: Proving that P(P) != the correct x86 emulation of the input to H(P,P)

By olcott on Fri Jun 10 13:18:17 2022

Latest reply by olcott on Fri Jun 10 13:18:17 2022