Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #34497 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-06-05 21:39 -0500 |
| Last post | 2021-06-06 13:14 -0700 |
| Articles | 20 — 4 participants |
Back to article view | Back to comp.theory
The key basis of the refutation of the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-06-05 21:39 -0500
Re: The key basis of the refutation of the halting problem proofs Mr Flibble <flibble@reddwarf.jmc> - 2021-06-06 18:24 +0100
Re: The key basis of the refutation of the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-06-06 14:14 -0500
Re: The key basis of the refutation of the halting problem proofs Mr Flibble <flibble@reddwarf.jmc> - 2021-06-06 20:32 +0100
Re: The key basis of the refutation of the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-06-06 14:36 -0500
Re: The key basis of the refutation of the halting problem proofs DV <xlt.pjw@gmail.com> - 2021-06-06 12:19 -0700
Re: The key basis of the refutation of the halting problem proofs Mr Flibble <flibble@reddwarf.jmc> - 2021-06-06 20:33 +0100
Re: The key basis of the refutation of the halting problem proofs DV <xlt.pjw@gmail.com> - 2021-06-06 12:57 -0700
Re: The key basis of the refutation of the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-06-06 14:34 -0500
Re: The key basis of the refutation of the halting problem proofs DV <xlt.pjw@gmail.com> - 2021-06-06 13:00 -0700
Re: The key basis of the refutation of the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-06-06 15:14 -0500
Re: The key basis of the refutation of the halting problem proofs DV <xlt.pjw@gmail.com> - 2021-06-06 13:19 -0700
Re: The key basis of the refutation of the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-06-06 18:08 -0500
Re: The key basis of the refutation of the halting problem proofs DV <xlt.pjw@gmail.com> - 2021-06-06 16:56 -0700
Re: The key basis of the refutation of the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-06-06 20:31 -0400
Re: The key basis of the refutation of the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-06-06 20:17 -0500
Re: The key basis of the refutation of the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-06-06 22:22 -0400
Re: The key basis of the refutation of the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-06-06 16:24 -0400
Re: The key basis of the refutation of the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-06-06 16:03 -0400
Re: The key basis of the refutation of the halting problem proofs DV <xlt.pjw@gmail.com> - 2021-06-06 13:14 -0700
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-05 21:39 -0500 |
| Subject | The key basis of the refutation of the halting problem proofs |
| Message-ID | <z6udnZYotcDUqCH9nZ2dnUU7-ffNnZ2d@giganews.com> |
When a simulating halt decider must abort the simulation of its input to
prevent the infinite execution of this input, this input is correctly
decided as not halting even though it has been forced to halt and thus
halts.
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation
// Simplified Linz Ĥ (Linz:1990:319)
void H_Hat(u32 P) {
u32 Input_Halts = H(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main() {
H_Hat((u32)H_Hat);
}
Because the input to H() on the first line of H_Hat() must be aborted to
prevent its infinite execution this input is correctly decided as
non-halting.
_H_Hat()
[00000af8](01) 55 push ebp
[00000af9](02) 8bec mov ebp,esp
[00000afb](01) 51 push ecx
[00000afc](03) 8b4508 mov eax,[ebp+08]
[00000aff](01) 50 push eax
[00000b00](03) 8b4d08 mov ecx,[ebp+08]
[00000b03](01) 51 push ecx
[00000b04](05) e81ffeffff call 00000928
[00000b09](03) 83c408 add esp,+08
[00000b0c](03) 8945fc mov [ebp-04],eax
[00000b0f](04) 837dfc00 cmp dword [ebp-04],+00
[00000b13](02) 7402 jz 00000b17
[00000b15](02) ebfe jmp 00000b15
[00000b17](02) 8be5 mov esp,ebp
[00000b19](01) 5d pop ebp
[00000b1a](01) c3 ret
Size in bytes:(0035) [00000b1a]
_main()
[00000b28](01) 55 push ebp
[00000b29](02) 8bec mov ebp,esp
[00000b2b](05) 68f80a0000 push 00000af8
[00000b30](05) e8c3ffffff call 00000af8
[00000b35](03) 83c404 add esp,+04
[00000b38](02) 33c0 xor eax,eax
[00000b3a](01) 5d pop ebp
[00000b3b](01) c3 ret
Size in bytes:(0020) [00000b3b]
===============================
...[00000b28][001014cf][00000000](01) 55 push ebp
...[00000b29][001014cf][00000000](02) 8bec mov ebp,esp
...[00000b2b][001014cb][00000af8](05) 68f80a0000 push 00000af8
...[00000b30][001014c7][00000b35](05) e8c3ffffff call 00000af8
...[00000af8][001014c3][001014cf](01) 55 push ebp
...[00000af9][001014c3][001014cf](02) 8bec mov ebp,esp
...[00000afb][001014bf][00000000](01) 51 push ecx
...[00000afc][001014bf][00000000](03) 8b4508 mov eax,[ebp+08]
...[00000aff][001014bb][00000af8](01) 50 push eax
...[00000b00][001014bb][00000af8](03) 8b4d08 mov ecx,[ebp+08]
...[00000b03][001014b7][00000af8](01) 51 push ecx
...[00000b04][001014b3][00000b09](05) e81ffeffff call 00000928
Begin Local Halt Decider Simulation at Machine Address:af8
...[00000af8][0021156f][00211573](01) 55 push ebp
...[00000af9][0021156f][00211573](02) 8bec mov ebp,esp
...[00000afb][0021156b][0020153f](01) 51 push ecx
...[00000afc][0021156b][0020153f](03) 8b4508 mov eax,[ebp+08]
...[00000aff][00211567][00000af8](01) 50 push eax
...[00000b00][00211567][00000af8](03) 8b4d08 mov ecx,[ebp+08]
...[00000b03][00211563][00000af8](01) 51 push ecx
...[00000b04][0021155f][00000b09](05) e81ffeffff call 00000928
...[00000af8][0025bf97][0025bf9b](01) 55 push ebp
...[00000af9][0025bf97][0025bf9b](02) 8bec mov ebp,esp
...[00000afb][0025bf93][0024bf67](01) 51 push ecx
...[00000afc][0025bf93][0024bf67](03) 8b4508 mov eax,[ebp+08]
...[00000aff][0025bf8f][00000af8](01) 50 push eax
...[00000b00][0025bf8f][00000af8](03) 8b4d08 mov ecx,[ebp+08]
...[00000b03][0025bf8b][00000af8](01) 51 push ecx
...[00000b04][0025bf87][00000b09](05) e81ffeffff call 00000928
Local Halt Decider: Infinite Recursion Detected Simulation Stopped
...[00000b09][001014bf][00000000](03) 83c408 add esp,+08
...[00000b0c][001014bf][00000000](03) 8945fc mov [ebp-04],eax
...[00000b0f][001014bf][00000000](04) 837dfc00 cmp dword
[ebp-04],+00
...[00000b13][001014bf][00000000](02) 7402 jz 00000b17
...[00000b17][001014c3][001014cf](02) 8be5 mov esp,ebp
...[00000b19][001014c7][00000b35](01) 5d pop ebp
...[00000b1a][001014cb][00000af8](01) c3 ret
...[00000b35][001014cf][00000000](03) 83c404 add esp,+04
...[00000b38][001014cf][00000000](02) 33c0 xor eax,eax
...[00000b3a][001014d3][00100000](01) 5d pop ebp
...[00000b3b][001014d7][00000098](01) c3 ret
Number_of_User_Instructions(39)
Number of Instructions Executed(26459)
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [next] | [standalone]
| From | Mr Flibble <flibble@reddwarf.jmc> |
|---|---|
| Date | 2021-06-06 18:24 +0100 |
| Message-ID | <20210606182454.000075ce@reddwarf.jmc> |
| In reply to | #34497 |
On Sat, 5 Jun 2021 21:39:16 -0500 olcott <NoOne@NoWhere.com> wrote: > When a simulating halt decider must abort the simulation of its input > to prevent the infinite execution of this input, this input is > correctly decided as not halting even though it has been forced to > halt and thus halts. > > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation Except you are unable to decide when to abort the simulation unless you also analyse branching logic predicated on arbitrary program input. Until you achieve this you have not refuted anything of substance. /Flibble
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-06 14:14 -0500 |
| Message-ID | <4KednXaWWJzpgyD9nZ2dnUU7-N2dnZ2d@giganews.com> |
| In reply to | #34504 |
On 6/6/2021 12:24 PM, Mr Flibble wrote: > On Sat, 5 Jun 2021 21:39:16 -0500 > olcott <NoOne@NoWhere.com> wrote: > >> When a simulating halt decider must abort the simulation of its input >> to prevent the infinite execution of this input, this input is >> correctly decided as not halting even though it has been forced to >> halt and thus halts. >> >> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > Except you are unable to decide when to abort the simulation unless you > also analyse branching logic predicated on arbitrary program input. > Until you achieve this you have not refuted anything of substance. > > /Flibble > When you say this you are making sure to not even glance at what I said on page 2. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@reddwarf.jmc> |
|---|---|
| Date | 2021-06-06 20:32 +0100 |
| Message-ID | <20210606203207.00003f41@reddwarf.jmc> |
| In reply to | #34505 |
On Sun, 6 Jun 2021 14:14:05 -0500 olcott <NoOne@NoWhere.com> wrote: > On 6/6/2021 12:24 PM, Mr Flibble wrote: > > On Sat, 5 Jun 2021 21:39:16 -0500 > > olcott <NoOne@NoWhere.com> wrote: > > > >> When a simulating halt decider must abort the simulation of its > >> input to prevent the infinite execution of this input, this input > >> is correctly decided as not halting even though it has been forced > >> to halt and thus halts. > >> > >> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > > > Except you are unable to decide when to abort the simulation unless > > you also analyse branching logic predicated on arbitrary program > > input. Until you achieve this you have not refuted anything of > > substance. > > > > /Flibble > > > > When you say this you are making sure to not even glance at what I > said on page 2. If I did that it would have the same effect as me reading the words written in crayon on the walls of a padded cell by its previous occupant. I repeat: until you solve the problem of analysing branching logic predicated on arbitrary program input you have not refuted anything of substance. Your "simulator" is based on emulating Intel x86 CPU is it not? Are you aware that, like with most CPUs, an 80x86 allows memory to be mapped to I/O devices rather than just RAM so a MOV instruction may be reading/writing from/to a device? Device I/O is also considered program "input" and can effectively be considered random in nature for the purposes of this discussion, i.e. another form of "arbitrary program input". /Flibble
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-06 14:36 -0500 |
| Message-ID | <u8GdnSz8AtBMviD9nZ2dnUU7-S-dnZ2d@giganews.com> |
| In reply to | #34507 |
On 6/6/2021 2:32 PM, Mr Flibble wrote: > On Sun, 6 Jun 2021 14:14:05 -0500 > olcott <NoOne@NoWhere.com> wrote: > >> On 6/6/2021 12:24 PM, Mr Flibble wrote: >>> On Sat, 5 Jun 2021 21:39:16 -0500 >>> olcott <NoOne@NoWhere.com> wrote: >>> >>>> When a simulating halt decider must abort the simulation of its >>>> input to prevent the infinite execution of this input, this input >>>> is correctly decided as not halting even though it has been forced >>>> to halt and thus halts. >>>> >>>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >>> >>> Except you are unable to decide when to abort the simulation unless >>> you also analyse branching logic predicated on arbitrary program >>> input. Until you achieve this you have not refuted anything of >>> substance. >>> >>> /Flibble >>> >> >> When you say this you are making sure to not even glance at what I >> said on page 2. > > If I did that it would have the same effect as me reading the words > written in crayon on the walls of a padded cell by its previous > occupant. > > I repeat: until you solve the problem of analysing branching logic > predicated on arbitrary program input you have not refuted anything of > substance. > > Your "simulator" is based on emulating Intel x86 CPU is it not? Are > you aware that, like with most CPUs, an 80x86 allows memory to be > mapped to I/O devices rather than just RAM so a MOV instruction may be > reading/writing from/to a device? Device I/O is also considered program > "input" and can effectively be considered random in nature for the > purposes of this discussion, i.e. another form of "arbitrary program > input". > > /Flibble > On page 2 I directly apply the computer science insights to the actual Linz proof, nitwit. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | DV <xlt.pjw@gmail.com> |
|---|---|
| Date | 2021-06-06 12:19 -0700 |
| Message-ID | <4641aa6f-79cc-4570-ac45-1b4baf6117a6n@googlegroups.com> |
| In reply to | #34504 |
On Sunday, June 6, 2021 at 1:24:57 PM UTC-4, Mr Flibble wrote: > On Sat, 5 Jun 2021 21:39:16 -0500 > olcott <No...@NoWhere.com> wrote: > > > When a simulating halt decider must abort the simulation of its input > > to prevent the infinite execution of this input, this input is > > correctly decided as not halting even though it has been forced to > > halt and thus halts. > > You're saying, "When an attempted Halting Problem solver 'gives up' in a sense, it is correct even though it has given up." > > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > Except you are unable to decide when to abort the simulation unless you > also analyse branching logic predicated on arbitrary program input. > Until you achieve this you have not refuted anything of substance. > > /Flibble Are you asking him for source code? Do you take him seriously? I admit I have my theories about why this multi-year cryptic conversation in which all parties pretend to be unaware of how the Halting Problem is resolved, rather obfuscatedly and boringly. If there's an ulterior motive beyond "having fun pretending not to understand basic math for years and years pretty much all day," would you care to share what that motive is? What's the point, is this some sort of secret business or political operation?
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@reddwarf.jmc> |
|---|---|
| Date | 2021-06-06 20:33 +0100 |
| Message-ID | <20210606203345.00007141@reddwarf.jmc> |
| In reply to | #34506 |
On Sun, 6 Jun 2021 12:19:20 -0700 (PDT) DV <xlt.pjw@gmail.com> wrote: [snip] > If there's an ulterior motive beyond "having fun pretending not to > understand basic math for years and years pretty much all day," would > you care to share what that motive is? What's the point, is this > some sort of secret business or political operation? I suggest that you should, like olcott, consider taking your meds. /Flibble
[toc] | [prev] | [next] | [standalone]
| From | DV <xlt.pjw@gmail.com> |
|---|---|
| Date | 2021-06-06 12:57 -0700 |
| Message-ID | <ae39ab17-a33b-4192-a2f9-37d813325f6fn@googlegroups.com> |
| In reply to | #34508 |
On Sunday, June 6, 2021 at 3:33:49 PM UTC-4, Mr Flibble wrote: > On Sun, 6 Jun 2021 12:19:20 -0700 (PDT) > DV <xlt...@gmail.com> wrote: > [snip] > > If there's an ulterior motive beyond "having fun pretending not to > > understand basic math for years and years pretty much all day," would > > you care to share what that motive is? What's the point, is this > > some sort of secret business or political operation? > I suggest that you should, like olcott, consider taking your meds. > > /Flibble As you might expect, my response is, "You are not using your real name and I am not here to discuss personal medical information with you one on one." Also: Do you have some sort of evidence or argument that there is no such thing as an ulterior motive? Would you like to present that, or do you concede the point? What do you find pathological about my comments? Do you insist that you do understand math well, and this is a serious discussion of TCS?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-06 14:34 -0500 |
| Message-ID | <u8GdnS38AtDcviD9nZ2dnUU7-S_NnZ2d@giganews.com> |
| In reply to | #34506 |
On 6/6/2021 2:19 PM, DV wrote: > On Sunday, June 6, 2021 at 1:24:57 PM UTC-4, Mr Flibble wrote: >> On Sat, 5 Jun 2021 21:39:16 -0500 >> olcott <No...@NoWhere.com> wrote: >> >>> When a simulating halt decider must abort the simulation of its input >>> to prevent the infinite execution of this input, this input is >>> correctly decided as not halting even though it has been forced to >>> halt and thus halts. >>> > > You're saying, "When an attempted Halting Problem solver 'gives up' in a sense, it is correct even though it has given up." > Not at all on the following link I show all of the details of how my halt decider simulates an infinite loop and terminates this simulation on the basis that it determines that the loop is infinite. On 6/5/2021 9:39 PM, olcott wrote: [The key basis of the refutation of the halting problem proofs] Anyone that is an expert C programmer and knows the x86 machine language quite well can see that my halt decider is correct on this input. >>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >> Except you are unable to decide when to abort the simulation unless you >> also analyse branching logic predicated on arbitrary program input. >> Until you achieve this you have not refuted anything of substance. >> >> /Flibble > > Are you asking him for source code? Do you take him seriously? > > > I admit I have my theories about why this multi-year cryptic conversation in which all parties pretend to be unaware of how the Halting Problem is resolved, rather obfuscatedly and boringly. > > If there's an ulterior motive beyond "having fun pretending not to understand basic math for years and years pretty much all day," would you care to share what that motive is? What's the point, is this some sort of secret business or political operation? > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | DV <xlt.pjw@gmail.com> |
|---|---|
| Date | 2021-06-06 13:00 -0700 |
| Message-ID | <c3f8609b-6f6f-4f48-b341-aca5e9c2719bn@googlegroups.com> |
| In reply to | #34509 |
On Sunday, June 6, 2021 at 3:34:32 PM UTC-4, olcott wrote: > On 6/6/2021 2:19 PM, DV wrote: > > On Sunday, June 6, 2021 at 1:24:57 PM UTC-4, Mr Flibble wrote: > >> On Sat, 5 Jun 2021 21:39:16 -0500 > >> olcott <No...@NoWhere.com> wrote: > >> > >>> When a simulating halt decider must abort the simulation of its input > >>> to prevent the infinite execution of this input, this input is > >>> correctly decided as not halting even though it has been forced to > >>> halt and thus halts. > >>> > > > > You're saying, "When an attempted Halting Problem solver 'gives up' in a sense, it is correct even though it has given up." > > > Not at all on the following link I show all of the details of how my > halt decider simulates an infinite loop and terminates this simulation > on the basis that it determines that the loop is infinite. > > On 6/5/2021 9:39 PM, olcott wrote: > [The key basis of the refutation of the halting problem proofs] > > Anyone that is an expert C programmer and knows the x86 machine language > quite well can see that my halt decider is correct on this input. > >>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > >> Except you are unable to decide when to abort the simulation unless you > >> also analyse branching logic predicated on arbitrary program input. > >> Until you achieve this you have not refuted anything of substance. > >> > >> /Flibble > > > > Are you asking him for source code? Do you take him seriously? > > > > > > I admit I have my theories about why this multi-year cryptic conversation in which all parties pretend to be unaware of how the Halting Problem is resolved, rather obfuscatedly and boringly. > > > > If there's an ulterior motive beyond "having fun pretending not to understand basic math for years and years pretty much all day," would you care to share what that motive is? What's the point, is this some sort of secret business or political operation? > > > -- > Copyright 2021 Pete Olcott > > "Great spirits have always encountered violent opposition from mediocre > minds." Einstein What exactly do you want? Do you have a goal from your posts on this Usenet group?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-06 15:14 -0500 |
| Message-ID | <T7SdnRBsYKcPsSD9nZ2dnUU7-XmdnZ2d@giganews.com> |
| In reply to | #34515 |
On 6/6/2021 3:00 PM, DV wrote: > On Sunday, June 6, 2021 at 3:34:32 PM UTC-4, olcott wrote: >> On 6/6/2021 2:19 PM, DV wrote: >>> On Sunday, June 6, 2021 at 1:24:57 PM UTC-4, Mr Flibble wrote: >>>> On Sat, 5 Jun 2021 21:39:16 -0500 >>>> olcott <No...@NoWhere.com> wrote: >>>> >>>>> When a simulating halt decider must abort the simulation of its input >>>>> to prevent the infinite execution of this input, this input is >>>>> correctly decided as not halting even though it has been forced to >>>>> halt and thus halts. >>>>> >>> >>> You're saying, "When an attempted Halting Problem solver 'gives up' in a sense, it is correct even though it has given up." >>> >> Not at all on the following link I show all of the details of how my >> halt decider simulates an infinite loop and terminates this simulation >> on the basis that it determines that the loop is infinite. >> >> On 6/5/2021 9:39 PM, olcott wrote: >> [The key basis of the refutation of the halting problem proofs] >> >> Anyone that is an expert C programmer and knows the x86 machine language >> quite well can see that my halt decider is correct on this input. >>>>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >>>> Except you are unable to decide when to abort the simulation unless you >>>> also analyse branching logic predicated on arbitrary program input. >>>> Until you achieve this you have not refuted anything of substance. >>>> >>>> /Flibble >>> >>> Are you asking him for source code? Do you take him seriously? >>> >>> >>> I admit I have my theories about why this multi-year cryptic conversation in which all parties pretend to be unaware of how the Halting Problem is resolved, rather obfuscatedly and boringly. >>> >>> If there's an ulterior motive beyond "having fun pretending not to understand basic math for years and years pretty much all day," would you care to share what that motive is? What's the point, is this some sort of secret business or political operation? >>> >> -- >> Copyright 2021 Pete Olcott >> >> "Great spirits have always encountered violent opposition from mediocre >> minds." Einstein > > What exactly do you want? Do you have a goal from your posts on this Usenet group? > I have correctly refuted the halting problem proofs. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | DV <xlt.pjw@gmail.com> |
|---|---|
| Date | 2021-06-06 13:19 -0700 |
| Message-ID | <73770e65-d164-430a-9b4c-73f8fc3c50d6n@googlegroups.com> |
| In reply to | #34519 |
On Sunday, June 6, 2021 at 4:14:18 PM UTC-4, olcott wrote: > On 6/6/2021 3:00 PM, DV wrote: > > On Sunday, June 6, 2021 at 3:34:32 PM UTC-4, olcott wrote: > >> On 6/6/2021 2:19 PM, DV wrote: > >>> On Sunday, June 6, 2021 at 1:24:57 PM UTC-4, Mr Flibble wrote: > >>>> On Sat, 5 Jun 2021 21:39:16 -0500 > >>>> olcott <No...@NoWhere.com> wrote: > >>>> > >>>>> When a simulating halt decider must abort the simulation of its input > >>>>> to prevent the infinite execution of this input, this input is > >>>>> correctly decided as not halting even though it has been forced to > >>>>> halt and thus halts. > >>>>> > >>> > >>> You're saying, "When an attempted Halting Problem solver 'gives up' in a sense, it is correct even though it has given up." > >>> > >> Not at all on the following link I show all of the details of how my > >> halt decider simulates an infinite loop and terminates this simulation > >> on the basis that it determines that the loop is infinite. > >> > >> On 6/5/2021 9:39 PM, olcott wrote: > >> [The key basis of the refutation of the halting problem proofs] > >> > >> Anyone that is an expert C programmer and knows the x86 machine language > >> quite well can see that my halt decider is correct on this input. > >>>>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > >>>> Except you are unable to decide when to abort the simulation unless you > >>>> also analyse branching logic predicated on arbitrary program input. > >>>> Until you achieve this you have not refuted anything of substance. > >>>> > >>>> /Flibble > >>> > >>> Are you asking him for source code? Do you take him seriously? > >>> > >>> > >>> I admit I have my theories about why this multi-year cryptic conversation in which all parties pretend to be unaware of how the Halting Problem is resolved, rather obfuscatedly and boringly. > >>> > >>> If there's an ulterior motive beyond "having fun pretending not to understand basic math for years and years pretty much all day," would you care to share what that motive is? What's the point, is this some sort of secret business or political operation? > >>> > >> -- > >> Copyright 2021 Pete Olcott > >> > >> "Great spirits have always encountered violent opposition from mediocre > >> minds." Einstein > > > > What exactly do you want? Do you have a goal from your posts on this Usenet group? > > > I have correctly refuted the halting problem proofs. > -- > Copyright 2021 Pete Olcott > > "Great spirits have always encountered violent opposition from mediocre > minds." Einstein Oh, are you going to publish them in a journal? Who hired you and why do they pay you to do this during working hours? I'm sure you could present an unintelligible summary of your work in a post if you wanted to, and I could tell you it's wrong, and you'd say something to get me to lose interest, and then I would lose interest, and indeed you would never halt. You don't have to halt; it doesn't look like your activity is illegal to me. Nevertheless, it feels "disappointing" at least to me that I have had trouble finding a job in the computer programming industry for over 10 years, in spite of the fact that I am vastly more productive, talented, and hard-working than any of you. Would any of you care to share some job search tips? How did you get employed at firms where you seem to do very little work? I would do lots of work if hired. I am interviewing for jobs CS jobs, but it really is hard for me for some reason. How did any of you (assuming some/all of you work in CS) get in to these jobs? I would work harder and more productively than any of you if I had a job like the ones I think I remember noting that you had. Maybe you work in a different industry and I'm confused though. -Philip
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-06 18:08 -0500 |
| Message-ID | <j-ydnTVCANrByCD9nZ2dnUU7-RvNnZ2d@giganews.com> |
| In reply to | #34520 |
On 6/6/2021 3:19 PM, DV wrote: > On Sunday, June 6, 2021 at 4:14:18 PM UTC-4, olcott wrote: >> On 6/6/2021 3:00 PM, DV wrote: >>> On Sunday, June 6, 2021 at 3:34:32 PM UTC-4, olcott wrote: >>>> On 6/6/2021 2:19 PM, DV wrote: >>>>> On Sunday, June 6, 2021 at 1:24:57 PM UTC-4, Mr Flibble wrote: >>>>>> On Sat, 5 Jun 2021 21:39:16 -0500 >>>>>> olcott <No...@NoWhere.com> wrote: >>>>>> >>>>>>> When a simulating halt decider must abort the simulation of its input >>>>>>> to prevent the infinite execution of this input, this input is >>>>>>> correctly decided as not halting even though it has been forced to >>>>>>> halt and thus halts. >>>>>>> >>>>> >>>>> You're saying, "When an attempted Halting Problem solver 'gives up' in a sense, it is correct even though it has given up." >>>>> >>>> Not at all on the following link I show all of the details of how my >>>> halt decider simulates an infinite loop and terminates this simulation >>>> on the basis that it determines that the loop is infinite. >>>> >>>> On 6/5/2021 9:39 PM, olcott wrote: >>>> [The key basis of the refutation of the halting problem proofs] >>>> >>>> Anyone that is an expert C programmer and knows the x86 machine language >>>> quite well can see that my halt decider is correct on this input. >>>>>>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >>>>>> Except you are unable to decide when to abort the simulation unless you >>>>>> also analyse branching logic predicated on arbitrary program input. >>>>>> Until you achieve this you have not refuted anything of substance. >>>>>> >>>>>> /Flibble >>>>> >>>>> Are you asking him for source code? Do you take him seriously? >>>>> >>>>> >>>>> I admit I have my theories about why this multi-year cryptic conversation in which all parties pretend to be unaware of how the Halting Problem is resolved, rather obfuscatedly and boringly. >>>>> >>>>> If there's an ulterior motive beyond "having fun pretending not to understand basic math for years and years pretty much all day," would you care to share what that motive is? What's the point, is this some sort of secret business or political operation? >>>>> >>>> -- >>>> Copyright 2021 Pete Olcott >>>> >>>> "Great spirits have always encountered violent opposition from mediocre >>>> minds." Einstein >>> >>> What exactly do you want? Do you have a goal from your posts on this Usenet group? >>> >> I have correctly refuted the halting problem proofs. >> -- >> Copyright 2021 Pete Olcott >> >> "Great spirits have always encountered violent opposition from mediocre >> minds." Einstein > > Oh, are you going to publish them in a journal? Who hired you and why do they pay you to do this during working hours? > I want to get published in a journal. Besides working on this full time I am retired. > I'm sure you could present an unintelligible summary of your work in a post if you wanted to, and I could tell you it's wrong, and you'd say something to get me to lose interest, and then I would lose interest, and indeed you would never halt. You don't have to halt; it doesn't look like your activity is illegal to me. Nevertheless, it feels "disappointing" at least to me that I have had trouble finding a job in the computer programming industry for over 10 years, in spite of the fact that I am vastly more productive, talented, and hard-working than any of you. > > Would any of you care to share some job search tips? How did you get employed at firms where you seem to do very little work? I would do lots of work if hired. I am interviewing for jobs CS jobs, but it really is hard for me for some reason. How did any of you (assuming some/all of you work in CS) get in to these jobs? I would work harder and more productively than any of you if I had a job like the ones I think I remember noting that you had. > > Maybe you work in a different industry and I'm confused though. > > -Philip > The key way to get hired is to prove that you have very recent high level experience in a job skill that currently has reasonably high demand. As an expert C++ software engineer I would have to show my recent experience creating the x86utm operating system. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | DV <xlt.pjw@gmail.com> |
|---|---|
| Date | 2021-06-06 16:56 -0700 |
| Message-ID | <bbac9a37-76c0-4ec8-b4e4-e7f312ab44a2n@googlegroups.com> |
| In reply to | #34524 |
On Sunday, June 6, 2021 at 7:08:19 PM UTC-4, olcott wrote: > On 6/6/2021 3:19 PM, DV wrote: > > On Sunday, June 6, 2021 at 4:14:18 PM UTC-4, olcott wrote: > >> On 6/6/2021 3:00 PM, DV wrote: > >>> On Sunday, June 6, 2021 at 3:34:32 PM UTC-4, olcott wrote: > >>>> On 6/6/2021 2:19 PM, DV wrote: > >>>>> On Sunday, June 6, 2021 at 1:24:57 PM UTC-4, Mr Flibble wrote: > >>>>>> On Sat, 5 Jun 2021 21:39:16 -0500 > >>>>>> olcott <No...@NoWhere.com> wrote: > >>>>>> > >>>>>>> When a simulating halt decider must abort the simulation of its input > >>>>>>> to prevent the infinite execution of this input, this input is > >>>>>>> correctly decided as not halting even though it has been forced to > >>>>>>> halt and thus halts. > >>>>>>> > >>>>> > >>>>> You're saying, "When an attempted Halting Problem solver 'gives up' in a sense, it is correct even though it has given up." > >>>>> > >>>> Not at all on the following link I show all of the details of how my > >>>> halt decider simulates an infinite loop and terminates this simulation > >>>> on the basis that it determines that the loop is infinite. > >>>> > >>>> On 6/5/2021 9:39 PM, olcott wrote: > >>>> [The key basis of the refutation of the halting problem proofs] > >>>> > >>>> Anyone that is an expert C programmer and knows the x86 machine language > >>>> quite well can see that my halt decider is correct on this input. > >>>>>>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > >>>>>> Except you are unable to decide when to abort the simulation unless you > >>>>>> also analyse branching logic predicated on arbitrary program input. > >>>>>> Until you achieve this you have not refuted anything of substance. > >>>>>> > >>>>>> /Flibble > >>>>> > >>>>> Are you asking him for source code? Do you take him seriously? > >>>>> > >>>>> > >>>>> I admit I have my theories about why this multi-year cryptic conversation in which all parties pretend to be unaware of how the Halting Problem is resolved, rather obfuscatedly and boringly. > >>>>> > >>>>> If there's an ulterior motive beyond "having fun pretending not to understand basic math for years and years pretty much all day," would you care to share what that motive is? What's the point, is this some sort of secret business or political operation? > >>>>> > >>>> -- > >>>> Copyright 2021 Pete Olcott > >>>> > >>>> "Great spirits have always encountered violent opposition from mediocre > >>>> minds." Einstein > >>> > >>> What exactly do you want? Do you have a goal from your posts on this Usenet group? > >>> > >> I have correctly refuted the halting problem proofs. > >> -- > >> Copyright 2021 Pete Olcott > >> > >> "Great spirits have always encountered violent opposition from mediocre > >> minds." Einstein > > > > Oh, are you going to publish them in a journal? Who hired you and why do they pay you to do this during working hours? > > > I want to get published in a journal. > Besides working on this full time I am retired. > > I'm sure you could present an unintelligible summary of your work in a post if you wanted to, and I could tell you it's wrong, and you'd say something to get me to lose interest, and then I would lose interest, and indeed you would never halt. You don't have to halt; it doesn't look like your activity is illegal to me. Nevertheless, it feels "disappointing" at least to me that I have had trouble finding a job in the computer programming industry for over 10 years, in spite of the fact that I am vastly more productive, talented, and hard-working than any of you. > > > > Would any of you care to share some job search tips? How did you get employed at firms where you seem to do very little work? I would do lots of work if hired. I am interviewing for jobs CS jobs, but it really is hard for me for some reason. How did any of you (assuming some/all of you work in CS) get in to these jobs? I would work harder and more productively than any of you if I had a job like the ones I think I remember noting that you had. > > > > Maybe you work in a different industry and I'm confused though. > > > > -Philip > > > The key way to get hired is to prove that you have very recent high > level experience in a job skill that currently has reasonably high demand. > > As an expert C++ software engineer I would have to show my recent > experience creating the x86utm operating system. > -- > Copyright 2021 Pete Olcott > > "Great spirits have always encountered violent opposition from mediocre > minds." Einstein It worked again, I'm losing interest in this.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-06 20:31 -0400 |
| Message-ID | <DNdvI.25370$N%.17521@fx05.iad> |
| In reply to | #34524 |
On 6/6/21 7:08 PM, olcott wrote: > On 6/6/2021 3:19 PM, DV wrote: >> On Sunday, June 6, 2021 at 4:14:18 PM UTC-4, olcott wrote: >>> On 6/6/2021 3:00 PM, DV wrote: >>>> On Sunday, June 6, 2021 at 3:34:32 PM UTC-4, olcott wrote: >>>>> On 6/6/2021 2:19 PM, DV wrote: >>>>>> On Sunday, June 6, 2021 at 1:24:57 PM UTC-4, Mr Flibble wrote: >>>>>>> On Sat, 5 Jun 2021 21:39:16 -0500 >>>>>>> olcott <No...@NoWhere.com> wrote: >>>>>>> >>>>>>>> When a simulating halt decider must abort the simulation of its >>>>>>>> input >>>>>>>> to prevent the infinite execution of this input, this input is >>>>>>>> correctly decided as not halting even though it has been forced to >>>>>>>> halt and thus halts. >>>>>>>> >>>>>> >>>>>> You're saying, "When an attempted Halting Problem solver 'gives >>>>>> up' in a sense, it is correct even though it has given up." >>>>>> >>>>> Not at all on the following link I show all of the details of how my >>>>> halt decider simulates an infinite loop and terminates this simulation >>>>> on the basis that it determines that the loop is infinite. >>>>> >>>>> On 6/5/2021 9:39 PM, olcott wrote: >>>>> [The key basis of the refutation of the halting problem proofs] >>>>> >>>>> Anyone that is an expert C programmer and knows the x86 machine >>>>> language >>>>> quite well can see that my halt decider is correct on this input. >>>>>>>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >>>>>>>> >>>>>>> Except you are unable to decide when to abort the simulation >>>>>>> unless you >>>>>>> also analyse branching logic predicated on arbitrary program input. >>>>>>> Until you achieve this you have not refuted anything of substance. >>>>>>> >>>>>>> /Flibble >>>>>> >>>>>> Are you asking him for source code? Do you take him seriously? >>>>>> >>>>>> >>>>>> I admit I have my theories about why this multi-year cryptic >>>>>> conversation in which all parties pretend to be unaware of how the >>>>>> Halting Problem is resolved, rather obfuscatedly and boringly. >>>>>> >>>>>> If there's an ulterior motive beyond "having fun pretending not to >>>>>> understand basic math for years and years pretty much all day," >>>>>> would you care to share what that motive is? What's the point, is >>>>>> this some sort of secret business or political operation? >>>>>> >>>>> -- >>>>> Copyright 2021 Pete Olcott >>>>> >>>>> "Great spirits have always encountered violent opposition from >>>>> mediocre >>>>> minds." Einstein >>>> >>>> What exactly do you want? Do you have a goal from your posts on this >>>> Usenet group? >>>> >>> I have correctly refuted the halting problem proofs. >>> -- >>> Copyright 2021 Pete Olcott >>> >>> "Great spirits have always encountered violent opposition from mediocre >>> minds." Einstein >> >> Oh, are you going to publish them in a journal? Who hired you and why >> do they pay you to do this during working hours? >> > > I want to get published in a journal. > Besides working on this full time I am retired. IF you want to do that, I suggest you just write it and get your rejection letter now. From what I see, you are unwilling to listen to actual criticism and turn you paper into something that actually has a factual basis, that a real journal would publish. You might be able to get published in JIR or AIR (not sure of their submission rules) but your topic might not quite qualify. > >> I'm sure you could present an unintelligible summary of your work in a >> post if you wanted to, and I could tell you it's wrong, and you'd say >> something to get me to lose interest, and then I would lose interest, >> and indeed you would never halt. You don't have to halt; it doesn't >> look like your activity is illegal to me. Nevertheless, it feels >> "disappointing" at least to me that I have had trouble finding a job >> in the computer programming industry for over 10 years, in spite of >> the fact that I am vastly more productive, talented, and hard-working >> than any of you. >> >> Would any of you care to share some job search tips? How did you get >> employed at firms where you seem to do very little work? I would do >> lots of work if hired. I am interviewing for jobs CS jobs, but it >> really is hard for me for some reason. How did any of you (assuming >> some/all of you work in CS) get in to these jobs? I would work harder >> and more productively than any of you if I had a job like the ones I >> think I remember noting that you had. >> >> Maybe you work in a different industry and I'm confused though. >> >> -Philip >> > > The key way to get hired is to prove that you have very recent high > level experience in a job skill that currently has reasonably high demand. > > As an expert C++ software engineer I would have to show my recent > experience creating the x86utm operating system. > From my experience GOOD programmers are in high demand, and we have trouble finding enough to keep the department staffed well. The key is GOOD programmers, and there are a lot of programmers out there that don't really know their stuff. From what you have shown so far, I would put you in that category. A Couple of things that I have noted so far: Your Simulator/Halt Decider has a very bad API. It SHOULD take the program to run as a pointer to function and the tape as a pointer to data, or even better take the program as a pointer to the file handle of hte COEF file, and a file handle for the data. This would mean that the program would have a proper isolated environment. You make up your own types for the fixed sized types. Admittedly a small nit, but C99 is over 20 years old, and even if you are using a C90 compiler, it is simple enough to create your own stdint.h header to define the basic types. You write code that ASSUMES that memory addresses are 32 bits. If you had done the first step right, it wouldn't have been an issue. Once you decided that you were going to pass addresses as an integer type, it should be a type known to always be able to hold an address, even if ported to a different environment, either your system creates its own Addr type that is typedefed, or you use the uintptr_t
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-06 20:17 -0500 |
| Message-ID | <N5GdnbN1Ncs97iD9nZ2dnUU7-UXNnZ2d@giganews.com> |
| In reply to | #34529 |
On 6/6/2021 7:31 PM, Richard Damon wrote: > On 6/6/21 7:08 PM, olcott wrote: >> On 6/6/2021 3:19 PM, DV wrote: >>> On Sunday, June 6, 2021 at 4:14:18 PM UTC-4, olcott wrote: >>>> On 6/6/2021 3:00 PM, DV wrote: >>>>> On Sunday, June 6, 2021 at 3:34:32 PM UTC-4, olcott wrote: >>>>>> On 6/6/2021 2:19 PM, DV wrote: >>>>>>> On Sunday, June 6, 2021 at 1:24:57 PM UTC-4, Mr Flibble wrote: >>>>>>>> On Sat, 5 Jun 2021 21:39:16 -0500 >>>>>>>> olcott <No...@NoWhere.com> wrote: >>>>>>>> >>>>>>>>> When a simulating halt decider must abort the simulation of its >>>>>>>>> input >>>>>>>>> to prevent the infinite execution of this input, this input is >>>>>>>>> correctly decided as not halting even though it has been forced to >>>>>>>>> halt and thus halts. >>>>>>>>> >>>>>>> >>>>>>> You're saying, "When an attempted Halting Problem solver 'gives >>>>>>> up' in a sense, it is correct even though it has given up." >>>>>>> >>>>>> Not at all on the following link I show all of the details of how my >>>>>> halt decider simulates an infinite loop and terminates this simulation >>>>>> on the basis that it determines that the loop is infinite. >>>>>> >>>>>> On 6/5/2021 9:39 PM, olcott wrote: >>>>>> [The key basis of the refutation of the halting problem proofs] >>>>>> >>>>>> Anyone that is an expert C programmer and knows the x86 machine >>>>>> language >>>>>> quite well can see that my halt decider is correct on this input. >>>>>>>>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >>>>>>>>> >>>>>>>> Except you are unable to decide when to abort the simulation >>>>>>>> unless you >>>>>>>> also analyse branching logic predicated on arbitrary program input. >>>>>>>> Until you achieve this you have not refuted anything of substance. >>>>>>>> >>>>>>>> /Flibble >>>>>>> >>>>>>> Are you asking him for source code? Do you take him seriously? >>>>>>> >>>>>>> >>>>>>> I admit I have my theories about why this multi-year cryptic >>>>>>> conversation in which all parties pretend to be unaware of how the >>>>>>> Halting Problem is resolved, rather obfuscatedly and boringly. >>>>>>> >>>>>>> If there's an ulterior motive beyond "having fun pretending not to >>>>>>> understand basic math for years and years pretty much all day," >>>>>>> would you care to share what that motive is? What's the point, is >>>>>>> this some sort of secret business or political operation? >>>>>>> >>>>>> -- >>>>>> Copyright 2021 Pete Olcott >>>>>> >>>>>> "Great spirits have always encountered violent opposition from >>>>>> mediocre >>>>>> minds." Einstein >>>>> >>>>> What exactly do you want? Do you have a goal from your posts on this >>>>> Usenet group? >>>>> >>>> I have correctly refuted the halting problem proofs. >>>> -- >>>> Copyright 2021 Pete Olcott >>>> >>>> "Great spirits have always encountered violent opposition from mediocre >>>> minds." Einstein >>> >>> Oh, are you going to publish them in a journal? Who hired you and why >>> do they pay you to do this during working hours? >>> >> >> I want to get published in a journal. >> Besides working on this full time I am retired. > > > IF you want to do that, I suggest you just write it and get your > rejection letter now. From what I see, you are unwilling to listen to > actual criticism and turn you paper into something that actually has a > factual basis, that a real journal would publish. > The only factual basis that anyone here is willing to acknowledge is the fact that they say they do not believe that I am correct. > You might be able to get published in JIR or AIR (not sure of their > submission rules) but your topic might not quite qualify. > >> >>> I'm sure you could present an unintelligible summary of your work in a >>> post if you wanted to, and I could tell you it's wrong, and you'd say >>> something to get me to lose interest, and then I would lose interest, >>> and indeed you would never halt. You don't have to halt; it doesn't >>> look like your activity is illegal to me. Nevertheless, it feels >>> "disappointing" at least to me that I have had trouble finding a job >>> in the computer programming industry for over 10 years, in spite of >>> the fact that I am vastly more productive, talented, and hard-working >>> than any of you. >>> >>> Would any of you care to share some job search tips? How did you get >>> employed at firms where you seem to do very little work? I would do >>> lots of work if hired. I am interviewing for jobs CS jobs, but it >>> really is hard for me for some reason. How did any of you (assuming >>> some/all of you work in CS) get in to these jobs? I would work harder >>> and more productively than any of you if I had a job like the ones I >>> think I remember noting that you had. >>> >>> Maybe you work in a different industry and I'm confused though. >>> >>> -Philip >>> >> >> The key way to get hired is to prove that you have very recent high >> level experience in a job skill that currently has reasonably high demand. >> >> As an expert C++ software engineer I would have to show my recent >> experience creating the x86utm operating system. >> > > From my experience GOOD programmers are in high demand, and we have > trouble finding enough to keep the department staffed well. > > The key is GOOD programmers, and there are a lot of programmers out > there that don't really know their stuff. > > From what you have shown so far, I would put you in that category. > > A Couple of things that I have noted so far: > > Your Simulator/Halt Decider has a very bad API. It SHOULD take the > program to run as a pointer to function and the tape as a pointer to > data, If I was just writing C code that would make sense. I am not just writing C code. The unsigned integer <is> the UTM tape element type of a contiguous sequence of tape elements. It is not so much that I am writing C code, instead I am leveraging the C language as a RASP equivalent machine description language. > or even better take the program as a pointer to the file handle of > hte COEF file, and a file handle for the data. This would mean that the > program would have a proper isolated environment. > > You make up your own types for the fixed sized types. Admittedly a small > nit, but C99 is over 20 years old, and even if you are using a C90 > compiler, it is simple enough to create your own stdint.h header to > define the basic types. > > You write code that ASSUMES that memory addresses are 32 bits. If you > had done the first step right, it wouldn't have been an issue. Once you > decided that you were going to pass addresses as an integer type, it > should be a type known to always be able to hold an address, even if > ported to a different environment, either your system creates its own > Addr type that is typedefed, or you use the uintptr_t > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-06 22:22 -0400 |
| Message-ID | <hpfvI.12899$Qn1.9360@fx22.iad> |
| In reply to | #34531 |
On 6/6/21 9:17 PM, olcott wrote: > On 6/6/2021 7:31 PM, Richard Damon wrote: > >> IF you want to do that, I suggest you just write it and get your >> rejection letter now. From what I see, you are unwilling to listen to >> actual criticism and turn you paper into something that actually has a >> factual basis, that a real journal would publish. >> > > The only factual basis that anyone here is willing to acknowledge is the > fact that they say they do not believe that I am correct. WRONG. We KNOW you are incorrect. FACT: The definition of Halting in comutation theory is based on the ACTUAL behavior of the machine. FACT: H^(H^), with your H, is shown to Halt FACT: H(H^,H^) says that H^(H^) is Non-Halting FACT: Halting != Non-Halting FACT: Thus H is wrong. > >> You might be able to get published in JIR or AIR (not sure of their >> submission rules) but your topic might not quite qualify. >> >>> >>>> I'm sure you could present an unintelligible summary of your work in a >>>> post if you wanted to, and I could tell you it's wrong, and you'd say >>>> something to get me to lose interest, and then I would lose interest, >>>> and indeed you would never halt. You don't have to halt; it doesn't >>>> look like your activity is illegal to me. Nevertheless, it feels >>>> "disappointing" at least to me that I have had trouble finding a job >>>> in the computer programming industry for over 10 years, in spite of >>>> the fact that I am vastly more productive, talented, and hard-working >>>> than any of you. >>>> >>>> Would any of you care to share some job search tips? How did you get >>>> employed at firms where you seem to do very little work? I would do >>>> lots of work if hired. I am interviewing for jobs CS jobs, but it >>>> really is hard for me for some reason. How did any of you (assuming >>>> some/all of you work in CS) get in to these jobs? I would work harder >>>> and more productively than any of you if I had a job like the ones I >>>> think I remember noting that you had. >>>> >>>> Maybe you work in a different industry and I'm confused though. >>>> >>>> -Philip >>>> >>> >>> The key way to get hired is to prove that you have very recent high >>> level experience in a job skill that currently has reasonably high >>> demand. >>> >>> As an expert C++ software engineer I would have to show my recent >>> experience creating the x86utm operating system. >>> >> >> From my experience GOOD programmers are in high demand, and we have >> trouble finding enough to keep the department staffed well. >> >> The key is GOOD programmers, and there are a lot of programmers out >> there that don't really know their stuff. >> >> From what you have shown so far, I would put you in that category. >> >> A Couple of things that I have noted so far: >> >> Your Simulator/Halt Decider has a very bad API. It SHOULD take the >> program to run as a pointer to function and the tape as a pointer to >> data, > > If I was just writing C code that would make sense. I am not just > writing C code. The unsigned integer <is> the UTM tape element type of a > contiguous sequence of tape elements.. But it isn't. You are NOT passing 'A Tape Element', as if you were, you provide on way to get to the rest of the tape. You are passing the ADDRESS of the tape in memory, ADDRESSES should be passed as pointers. > > It is not so much that I am writing C code, instead I am leveraging the > C language as a RASP equivalent machine description language. Except that it really isn't, and I don't think you even really understand what that means. The C Language is a Turing Complete language, which means that anything you can do with a Turing Machine you can do with a C program, and any complete computation done as a C program can also be done by a Turing Machine. (key note-Complete Computation, not all code snippets have a Turing Machine Equivalent, only complete computations). I have never heard the term 'RASP equivalent' used in any real setting. The RASP Machine Model is Turing Complete, so every Turing Machine can be made in the form of a RASP machine, and all complete computations done on a RASP machine can be done on a Turing Machine, so having a 'RASP Equivalent' is no different than saying you have a Turing Equivalent. The C program structure does NOT directly map to the RASP architecture, and neither does x86 assembly. Besides the fact that x86 doesn't have unbounded size memory elements, RASP machines do NOT have register sets like the x86. The RASP architecture has a single accumulator, and all other operands are direct accessed in memory, there isn't even indexing or indirect, it is just that the address field of each instruction is a memory address that can be targeted by memory modifying instructions. If you really wanted to write you programs in RASP, writing a simple RASP emulator isn't that hard, and if you are a competent C programmer maybe you could rework the code generator section of a C compiler to generate RASP code. My guess is the RASP emulatior is just hours of work to write, the biggest challenge is to work out a good API to specify how to get data into and results out of the machine. The Code Generator is probably a tougher challenge, it isn't something I needed to do.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-06 16:24 -0400 |
| Message-ID | <L9avI.7425$Qn1.2988@fx22.iad> |
| In reply to | #34519 |
On 6/6/21 4:14 PM, olcott wrote: >> What exactly do you want? Do you have a goal from your posts on this >> Usenet group? >> > > I have correctly refuted the halting problem proofs. > Only in your own mind.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-06 16:03 -0400 |
| Message-ID | <xS9vI.352159$Skn4.317804@fx17.iad> |
| In reply to | #34509 |
On 6/6/21 3:34 PM, olcott wrote: > Not at all on the following link I show all of the details of how my > halt decider simulates an infinite loop and terminates this simulation > on the basis that it determines that the loop is infinite. > > On 6/5/2021 9:39 PM, olcott wrote: > [The key basis of the refutation of the halting problem proofs] > > Anyone that is an expert C programmer and knows the x86 machine language > quite well can see that my halt decider is correct on this input. NOPE. A machine that Halts, is a Halting Machine, even of some simulationg Halt decider is unable to determine this so looks at a different machine to make its wrong decision.
[toc] | [prev] | [next] | [standalone]
| From | DV <xlt.pjw@gmail.com> |
|---|---|
| Date | 2021-06-06 13:14 -0700 |
| Message-ID | <7b3f8f8c-7b10-4722-8ab6-dfa185be2b17n@googlegroups.com> |
| In reply to | #34516 |
On Sunday, June 6, 2021 at 4:03:43 PM UTC-4, Richard Damon wrote: > On 6/6/21 3:34 PM, olcott wrote: > > > Not at all on the following link I show all of the details of how my > > halt decider simulates an infinite loop and terminates this simulation > > on the basis that it determines that the loop is infinite. > > > > On 6/5/2021 9:39 PM, olcott wrote: > > [The key basis of the refutation of the halting problem proofs] > > > > Anyone that is an expert C programmer and knows the x86 machine language > > quite well can see that my halt decider is correct on this input. > NOPE. A machine that Halts, is a Halting Machine, even of some > simulationg Halt decider is unable to determine this so looks at a > different machine to make its wrong decision. Does this mean you're going to say what you want? Do you think you'll get you want out of this, aside from a few fun diverting conversations with Peter Olcott, if, when asked, you don't say what it is that you want clearly or at all? I guess you're just here wasting time, too, just like everyone else. Don't all of you have jobs? What do you tell your bosses about what you are doing all day on company time? I guess today is the weekend, but aren't you guys on here writing about stuff during working hours all the time? Do the firms that have hired you have any concerns about how you use your time?
[toc] | [prev] | [standalone]
Back to top | Article view | comp.theory
csiph-web