Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #25120 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2020-11-11 08:45 -0600 |
| Last post | 2020-11-12 22:11 -0600 |
| Articles | 17 on this page of 37 — 6 participants |
Back to article view | Back to comp.theory
Refuting the halting problem proofs by deciding the previously undecidable input (V5) (new material added) olcott <NoOne@NoWhere.com> - 2020-11-11 08:45 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (new material added) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-11 15:23 +0000
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (new material added) olcott <NoOne@NoWhere.com> - 2020-11-11 09:26 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (new material added) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-11 17:29 +0000
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (new material added) olcott <NoOne@NoWhere.com> - 2020-11-11 17:13 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (new material added) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-12 01:06 +0000
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (tautology) olcott <NoOne@NoWhere.com> - 2020-11-11 19:20 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (tautology) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-12 02:08 +0000
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-12 00:09 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) André G. Isaak <agisaak@gm.invalid> - 2020-11-12 08:06 -0700
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-12 09:19 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) André G. Isaak <agisaak@gm.invalid> - 2020-11-12 10:40 -0700
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-12 12:21 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) André G. Isaak <agisaak@gm.invalid> - 2020-11-12 12:09 -0700
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-12 22:46 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) André G. Isaak <agisaak@gm.invalid> - 2020-11-13 01:22 -0700
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-13 07:55 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-13 07:57 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) André G. Isaak <agisaak@gm.invalid> - 2020-11-13 09:12 -0700
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-13 10:21 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-13 11:17 +0000
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-13 07:48 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) Richard Damon <Richard@Damon-Family.org> - 2020-11-13 10:22 -0500
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-13 09:28 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) Richard Damon <Richard@Damon-Family.org> - 2020-11-13 10:46 -0500
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-13 10:16 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) Richard Damon <Richard@Damon-Family.org> - 2020-11-13 11:44 -0500
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-13 11:22 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-13 15:54 +0000
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-12 15:23 +0000
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-12 09:30 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) Richard Damon <Richard@Damon-Family.org> - 2020-11-12 11:19 -0500
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-12 10:36 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) Richard Damon <Richard@Damon-Family.org> - 2020-11-12 12:47 -0500
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-11-12 12:21 -0800
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-12 22:48 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) olcott <NoOne@NoWhere.com> - 2020-11-12 22:11 -0600
Page 2 of 2 — ← Prev page 1 [2]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-11-13 11:17 +0000 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <87eekxpkub.fsf@bsb.me.uk> |
| In reply to | #25210 |
olcott <NoOne@NoWhere.com> writes: > When-so-ever UTM halt decider H decides that: > (1) its input (<P>,I) would never halt unless H stopped simulating it > and > (2) its input (<P>,I) would never halt unless H stopped simulating it > then H has made a correct not-halting decision on this input. And, in a separate point to André's, I encourage you to post this mantra every time you write about this topic because it makes it crystal clear that you are not talking about the halting problem. The correct return from H for the input <<P>, I> is true if P(I) is a finite computation and false otherwise. That is the halting problem. P(I) is a finite computation even if it includes a call to H that "had to stop it". P(I) is a finite computation even if that is the /only/ reason for it being one. P(I) is a finite computation if the execution is finite regardless of the reason or mechanism. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-13 07:48 -0600 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <3NWdnRURx5EuEzPCnZ2dnUU7-WnNnZ2d@giganews.com> |
| In reply to | #25213 |
On 11/13/2020 5:17 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> When-so-ever UTM halt decider H decides that:
>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>> and
>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>> then H has made a correct not-halting decision on this input.
>
> And, in a separate point to André's, I encourage you to post this mantra
> every time you write about this topic because it makes it crystal clear
> that you are not talking about the halting problem.
>
> The correct return from H for the input <<P>, I> is true if P(I) is a
> finite computation and false otherwise. That is the halting problem.
> P(I) is a finite computation even if it includes a call to H that "had
> to stop it". P(I) is a finite computation even if that is the /only/
> reason for it being one. P(I) is a finite computation if the execution
> is finite regardless of the reason or mechanism.
>
Since it does divide all of its inputs into {halting and not-halting} it
is a halt decider. That it does not use the defective criteria that can
be fooled by an input that does the opposite of whatever the halt
decider decides makes the halting problem decidable.
--
Copyright 2020 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 | 2020-11-13 10:22 -0500 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <1xxrH.532783$0W4.118610@fx42.iad> |
| In reply to | #25214 |
On 11/13/20 8:48 AM, olcott wrote:
> On 11/13/2020 5:17 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> When-so-ever UTM halt decider H decides that:
>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>> and
>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>> then H has made a correct not-halting decision on this input.
>>
>> And, in a separate point to André's, I encourage you to post this mantra
>> every time you write about this topic because it makes it crystal clear
>> that you are not talking about the halting problem.
>>
>> The correct return from H for the input <<P>, I> is true if P(I) is a
>> finite computation and false otherwise. That is the halting problem.
>> P(I) is a finite computation even if it includes a call to H that "had
>> to stop it". P(I) is a finite computation even if that is the /only/
>> reason for it being one. P(I) is a finite computation if the execution
>> is finite regardless of the reason or mechanism.
>>
>
> Since it does divide all of its inputs into {halting and not-halting} it
> is a halt decider. That it does not use the defective criteria that can
> be fooled by an input that does the opposite of whatever the halt
> decider decides makes the halting problem decidable.
>
ONLY if the division into Halting and non-halting is on the correct
basis of it the original machine halted or not. Your 'decider'
incorrectly determines that machines that will naturally halt, due to
the required finite nature of H, will need to be aborted, and thus
called non-halting, not due to infinite behavior of the machines, but
due to limitations in your definition of H which can not handle many
forms of recursive calls, which in the basic definition it needs to handle.
Note, H is DEFINED as a Universal Turing Halting Decider which will
decide if ANY Turing Machine (including Turing Machines which imbed
copies of H in them) will ultimately Halt or be forever non-Halting, and
that H will make that determination in finite time.
Your version of H fails at this duty, and as such isn't a Halting
Decider, or at least not a Correct Halting Decider (and if it isn't
correct, it isn't really a decider). You could perhaps reframe your H as
a partial halting decider, but then it isn't applicable to Linz.
You also could frame you machine as an aborted decider, with an
understanding that your definition of aborted is NOT the same as the
definition of non-Halting, as you will decide to abort some machines
that will halt. I also suspect that you machine will either not decide
or decide incorrectly for some other machines.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-13 09:28 -0600 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <9pOdnV6-_dGbOzPCnZ2dnUU7-InNnZ2d@giganews.com> |
| In reply to | #25220 |
On 11/13/2020 9:22 AM, Richard Damon wrote:
> On 11/13/20 8:48 AM, olcott wrote:
>> On 11/13/2020 5:17 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> When-so-ever UTM halt decider H decides that:
>>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>>> and
>>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>>> then H has made a correct not-halting decision on this input.
>>>
>>> And, in a separate point to André's, I encourage you to post this mantra
>>> every time you write about this topic because it makes it crystal clear
>>> that you are not talking about the halting problem.
>>>
>>> The correct return from H for the input <<P>, I> is true if P(I) is a
>>> finite computation and false otherwise. That is the halting problem.
>>> P(I) is a finite computation even if it includes a call to H that "had
>>> to stop it". P(I) is a finite computation even if that is the /only/
>>> reason for it being one. P(I) is a finite computation if the execution
>>> is finite regardless of the reason or mechanism.
>>>
>>
>> Since it does divide all of its inputs into {halting and not-halting} it
>> is a halt decider. That it does not use the defective criteria that can
>> be fooled by an input that does the opposite of whatever the halt
>> decider decides makes the halting problem decidable.
>>
>
> ONLY if the division into Halting and non-halting is on the correct
> basis of it the original machine halted or not. Your 'decider'
> incorrectly determines that machines that will naturally halt, due to
> the required finite nature of H, will need to be aborted, and thus
> called non-halting, not due to infinite behavior of the machines, but
> due to limitations in your definition of H which can not handle many
> forms of recursive calls, which in the basic definition it needs to handle.
>
> Note, H is DEFINED as a Universal Turing Halting Decider which will
> decide if ANY Turing Machine (including Turing Machines which imbed
> copies of H in them) will ultimately Halt or be forever non-Halting, and
> that H will make that determination in finite time.
>
> Your version of H fails at this duty, and as such isn't a Halting
> Decider, or at least not a Correct Halting Decider (and if it isn't
> correct, it isn't really a decider). You could perhaps reframe your H as
> a partial halting decider, but then it isn't applicable to Linz.
>
> You also could frame you machine as an aborted decider, with an
> understanding that your definition of aborted is NOT the same as the
> definition of non-Halting, as you will decide to abort some machines
> that will halt. I also suspect that you machine will either not decide
> or decide incorrectly for some other machines.
>
If a person decides that a black cat is black and this cat is black then
the person's decision is correct.
If a UTM decider H decides that:
(1) Its input (<P>,I) would never halt unless H stopped simulating it
and
(2) Its input (<P>,I) would never halt unless H stopped simulating it
then H has made a correct decision on this input.
--
Copyright 2020 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 | 2020-11-13 10:46 -0500 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <vTxrH.529688$RF4.144210@fx43.iad> |
| In reply to | #25223 |
On 11/13/20 10:28 AM, olcott wrote:
> On 11/13/2020 9:22 AM, Richard Damon wrote:
>> On 11/13/20 8:48 AM, olcott wrote:
>>> On 11/13/2020 5:17 AM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> When-so-ever UTM halt decider H decides that:
>>>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>>>> and
>>>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>>>> then H has made a correct not-halting decision on this input.
>>>>
>>>> And, in a separate point to André's, I encourage you to post this
>>>> mantra
>>>> every time you write about this topic because it makes it crystal clear
>>>> that you are not talking about the halting problem.
>>>>
>>>> The correct return from H for the input <<P>, I> is true if P(I) is a
>>>> finite computation and false otherwise. That is the halting problem.
>>>> P(I) is a finite computation even if it includes a call to H that "had
>>>> to stop it". P(I) is a finite computation even if that is the /only/
>>>> reason for it being one. P(I) is a finite computation if the execution
>>>> is finite regardless of the reason or mechanism.
>>>>
>>>
>>> Since it does divide all of its inputs into {halting and not-halting} it
>>> is a halt decider. That it does not use the defective criteria that can
>>> be fooled by an input that does the opposite of whatever the halt
>>> decider decides makes the halting problem decidable.
>>>
>>
>> ONLY if the division into Halting and non-halting is on the correct
>> basis of it the original machine halted or not. Your 'decider'
>> incorrectly determines that machines that will naturally halt, due to
>> the required finite nature of H, will need to be aborted, and thus
>> called non-halting, not due to infinite behavior of the machines, but
>> due to limitations in your definition of H which can not handle many
>> forms of recursive calls, which in the basic definition it needs to
>> handle.
>>
>> Note, H is DEFINED as a Universal Turing Halting Decider which will
>> decide if ANY Turing Machine (including Turing Machines which imbed
>> copies of H in them) will ultimately Halt or be forever non-Halting, and
>> that H will make that determination in finite time.
>>
>> Your version of H fails at this duty, and as such isn't a Halting
>> Decider, or at least not a Correct Halting Decider (and if it isn't
>> correct, it isn't really a decider). You could perhaps reframe your H as
>> a partial halting decider, but then it isn't applicable to Linz.
>>
>> You also could frame you machine as an aborted decider, with an
>> understanding that your definition of aborted is NOT the same as the
>> definition of non-Halting, as you will decide to abort some machines
>> that will halt. I also suspect that you machine will either not decide
>> or decide incorrectly for some other machines.
>>
>
> If a person decides that a black cat is black and this cat is black then
> the person's decision is correct.
>
> If a UTM decider H decides that:
> (1) Its input (<P>,I) would never halt unless H stopped simulating it
> and
> (2) Its input (<P>,I) would never halt unless H stopped simulating it
> then H has made a correct decision on this input.
>
>
Yes, you may have defined a 'My code needed to abort the execution of
this program to stop it' decider, but that is not the same thing as a
'Halting' Decider, so has no bearing on theorems about halting.
That is like someone asking if a figure is a square, and the answer
given is the cat is black.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-13 10:16 -0600 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <Z6CdnVHxBpjCLDPCnZ2dnUU7-ctQAAAA@giganews.com> |
| In reply to | #25228 |
On 11/13/2020 9:46 AM, Richard Damon wrote:
> On 11/13/20 10:28 AM, olcott wrote:
>> On 11/13/2020 9:22 AM, Richard Damon wrote:
>>> On 11/13/20 8:48 AM, olcott wrote:
>>>> On 11/13/2020 5:17 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> When-so-ever UTM halt decider H decides that:
>>>>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>> and
>>>>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>> then H has made a correct not-halting decision on this input.
>>>>>
>>>>> And, in a separate point to André's, I encourage you to post this
>>>>> mantra
>>>>> every time you write about this topic because it makes it crystal clear
>>>>> that you are not talking about the halting problem.
>>>>>
>>>>> The correct return from H for the input <<P>, I> is true if P(I) is a
>>>>> finite computation and false otherwise. That is the halting problem.
>>>>> P(I) is a finite computation even if it includes a call to H that "had
>>>>> to stop it". P(I) is a finite computation even if that is the /only/
>>>>> reason for it being one. P(I) is a finite computation if the execution
>>>>> is finite regardless of the reason or mechanism.
>>>>>
>>>>
>>>> Since it does divide all of its inputs into {halting and not-halting} it
>>>> is a halt decider. That it does not use the defective criteria that can
>>>> be fooled by an input that does the opposite of whatever the halt
>>>> decider decides makes the halting problem decidable.
>>>>
>>>
>>> ONLY if the division into Halting and non-halting is on the correct
>>> basis of it the original machine halted or not. Your 'decider'
>>> incorrectly determines that machines that will naturally halt, due to
>>> the required finite nature of H, will need to be aborted, and thus
>>> called non-halting, not due to infinite behavior of the machines, but
>>> due to limitations in your definition of H which can not handle many
>>> forms of recursive calls, which in the basic definition it needs to
>>> handle.
>>>
>>> Note, H is DEFINED as a Universal Turing Halting Decider which will
>>> decide if ANY Turing Machine (including Turing Machines which imbed
>>> copies of H in them) will ultimately Halt or be forever non-Halting, and
>>> that H will make that determination in finite time.
>>>
>>> Your version of H fails at this duty, and as such isn't a Halting
>>> Decider, or at least not a Correct Halting Decider (and if it isn't
>>> correct, it isn't really a decider). You could perhaps reframe your H as
>>> a partial halting decider, but then it isn't applicable to Linz.
>>>
>>> You also could frame you machine as an aborted decider, with an
>>> understanding that your definition of aborted is NOT the same as the
>>> definition of non-Halting, as you will decide to abort some machines
>>> that will halt. I also suspect that you machine will either not decide
>>> or decide incorrectly for some other machines.
>>>
>>
>> If a person decides that a black cat is black and this cat is black then
>> the person's decision is correct.
>>
>> If a UTM decider H decides that:
>> (1) Its input (<P>,I) would never halt unless H stopped simulating it
>> and
>> (2) Its input (<P>,I) would never halt unless H stopped simulating it
>> then H has made a correct decision on this input.
>>
>>
>
> Yes, you may have defined a 'My code needed to abort the execution of
> this program to stop it' decider, but that is not the same thing as a
> 'Halting' Decider, so has no bearing on theorems about halting.
Since H does divide all of its inputs into {halting and not-halting}**
it is a halt decider.
**The Halting problem is a problem in computer science.
The problem is looking at a computer program and finding
out if the program is going to run forever or not. We say
that a program "solves the halting problem" if it can
look at any other program and tell if that other program
will run forever or not.
https://simple.wikipedia.org/wiki/Halting_problem
--
Copyright 2020 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 | 2020-11-13 11:44 -0500 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <7KyrH.792482$eN2.539915@fx47.iad> |
| In reply to | #25235 |
On 11/13/20 11:16 AM, olcott wrote:
> On 11/13/2020 9:46 AM, Richard Damon wrote:
>> On 11/13/20 10:28 AM, olcott wrote:
>>> On 11/13/2020 9:22 AM, Richard Damon wrote:
>>>> On 11/13/20 8:48 AM, olcott wrote:
>>>>> On 11/13/2020 5:17 AM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> When-so-ever UTM halt decider H decides that:
>>>>>>> (1) its input (<P>,I) would never halt unless H stopped
>>>>>>> simulating it
>>>>>>> and
>>>>>>> (2) its input (<P>,I) would never halt unless H stopped
>>>>>>> simulating it
>>>>>>> then H has made a correct not-halting decision on this input.
>>>>>>
>>>>>> And, in a separate point to André's, I encourage you to post this
>>>>>> mantra
>>>>>> every time you write about this topic because it makes it crystal
>>>>>> clear
>>>>>> that you are not talking about the halting problem.
>>>>>>
>>>>>> The correct return from H for the input <<P>, I> is true if P(I) is a
>>>>>> finite computation and false otherwise. That is the halting problem.
>>>>>> P(I) is a finite computation even if it includes a call to H that
>>>>>> "had
>>>>>> to stop it". P(I) is a finite computation even if that is the /only/
>>>>>> reason for it being one. P(I) is a finite computation if the
>>>>>> execution
>>>>>> is finite regardless of the reason or mechanism.
>>>>>>
>>>>>
>>>>> Since it does divide all of its inputs into {halting and
>>>>> not-halting} it
>>>>> is a halt decider. That it does not use the defective criteria that
>>>>> can
>>>>> be fooled by an input that does the opposite of whatever the halt
>>>>> decider decides makes the halting problem decidable.
>>>>>
>>>>
>>>> ONLY if the division into Halting and non-halting is on the correct
>>>> basis of it the original machine halted or not. Your 'decider'
>>>> incorrectly determines that machines that will naturally halt, due to
>>>> the required finite nature of H, will need to be aborted, and thus
>>>> called non-halting, not due to infinite behavior of the machines, but
>>>> due to limitations in your definition of H which can not handle many
>>>> forms of recursive calls, which in the basic definition it needs to
>>>> handle.
>>>>
>>>> Note, H is DEFINED as a Universal Turing Halting Decider which will
>>>> decide if ANY Turing Machine (including Turing Machines which imbed
>>>> copies of H in them) will ultimately Halt or be forever non-Halting,
>>>> and
>>>> that H will make that determination in finite time.
>>>>
>>>> Your version of H fails at this duty, and as such isn't a Halting
>>>> Decider, or at least not a Correct Halting Decider (and if it isn't
>>>> correct, it isn't really a decider). You could perhaps reframe your
>>>> H as
>>>> a partial halting decider, but then it isn't applicable to Linz.
>>>>
>>>> You also could frame you machine as an aborted decider, with an
>>>> understanding that your definition of aborted is NOT the same as the
>>>> definition of non-Halting, as you will decide to abort some machines
>>>> that will halt. I also suspect that you machine will either not decide
>>>> or decide incorrectly for some other machines.
>>>>
>>>
>>> If a person decides that a black cat is black and this cat is black then
>>> the person's decision is correct.
>>>
>>> If a UTM decider H decides that:
>>> (1) Its input (<P>,I) would never halt unless H stopped simulating it
>>> and
>>> (2) Its input (<P>,I) would never halt unless H stopped simulating it
>>> then H has made a correct decision on this input.
>>>
>>>
>>
>> Yes, you may have defined a 'My code needed to abort the execution of
>> this program to stop it' decider, but that is not the same thing as a
>> 'Halting' Decider, so has no bearing on theorems about halting.
>
> Since H does divide all of its inputs into {halting and not-halting}**
> it is a halt decider.
>
> **The Halting problem is a problem in computer science.
> The problem is looking at a computer program and finding
> out if the program is going to run forever or not. We say
> that a program "solves the halting problem" if it can
> look at any other program and tell if that other program
> will run forever or not.
> https://simple.wikipedia.org/wiki/Halting_problem
>
>
Except that it doesn't divide on Halting, it divides based on its own
(incorrect) opinion of needing to abort, with a definition of aborting
(because it is not based on actual need, but its own opinion of need)
that differs from non-halting.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-13 11:22 -0600 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <G_6dnfRktulbXTPCnZ2dnUU7-Y2dnZ2d@giganews.com> |
| In reply to | #25241 |
On 11/13/2020 10:44 AM, Richard Damon wrote:
> On 11/13/20 11:16 AM, olcott wrote:
>> On 11/13/2020 9:46 AM, Richard Damon wrote:
>>> On 11/13/20 10:28 AM, olcott wrote:
>>>> On 11/13/2020 9:22 AM, Richard Damon wrote:
>>>>> On 11/13/20 8:48 AM, olcott wrote:
>>>>>> On 11/13/2020 5:17 AM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> When-so-ever UTM halt decider H decides that:
>>>>>>>> (1) its input (<P>,I) would never halt unless H stopped
>>>>>>>> simulating it
>>>>>>>> and
>>>>>>>> (2) its input (<P>,I) would never halt unless H stopped
>>>>>>>> simulating it
>>>>>>>> then H has made a correct not-halting decision on this input.
>>>>>>>
>>>>>>> And, in a separate point to André's, I encourage you to post this
>>>>>>> mantra
>>>>>>> every time you write about this topic because it makes it crystal
>>>>>>> clear
>>>>>>> that you are not talking about the halting problem.
>>>>>>>
>>>>>>> The correct return from H for the input <<P>, I> is true if P(I) is a
>>>>>>> finite computation and false otherwise. That is the halting problem.
>>>>>>> P(I) is a finite computation even if it includes a call to H that
>>>>>>> "had
>>>>>>> to stop it". P(I) is a finite computation even if that is the /only/
>>>>>>> reason for it being one. P(I) is a finite computation if the
>>>>>>> execution
>>>>>>> is finite regardless of the reason or mechanism.
>>>>>>>
>>>>>>
>>>>>> Since it does divide all of its inputs into {halting and
>>>>>> not-halting} it
>>>>>> is a halt decider. That it does not use the defective criteria that
>>>>>> can
>>>>>> be fooled by an input that does the opposite of whatever the halt
>>>>>> decider decides makes the halting problem decidable.
>>>>>>
>>>>>
>>>>> ONLY if the division into Halting and non-halting is on the correct
>>>>> basis of it the original machine halted or not. Your 'decider'
>>>>> incorrectly determines that machines that will naturally halt, due to
>>>>> the required finite nature of H, will need to be aborted, and thus
>>>>> called non-halting, not due to infinite behavior of the machines, but
>>>>> due to limitations in your definition of H which can not handle many
>>>>> forms of recursive calls, which in the basic definition it needs to
>>>>> handle.
>>>>>
>>>>> Note, H is DEFINED as a Universal Turing Halting Decider which will
>>>>> decide if ANY Turing Machine (including Turing Machines which imbed
>>>>> copies of H in them) will ultimately Halt or be forever non-Halting,
>>>>> and
>>>>> that H will make that determination in finite time.
>>>>>
>>>>> Your version of H fails at this duty, and as such isn't a Halting
>>>>> Decider, or at least not a Correct Halting Decider (and if it isn't
>>>>> correct, it isn't really a decider). You could perhaps reframe your
>>>>> H as
>>>>> a partial halting decider, but then it isn't applicable to Linz.
>>>>>
>>>>> You also could frame you machine as an aborted decider, with an
>>>>> understanding that your definition of aborted is NOT the same as the
>>>>> definition of non-Halting, as you will decide to abort some machines
>>>>> that will halt. I also suspect that you machine will either not decide
>>>>> or decide incorrectly for some other machines.
>>>>>
>>>>
>>>> If a person decides that a black cat is black and this cat is black then
>>>> the person's decision is correct.
>>>>
>>>> If a UTM decider H decides that:
>>>> (1) Its input (<P>,I) would never halt unless H stopped simulating it
>>>> and
>>>> (2) Its input (<P>,I) would never halt unless H stopped simulating it
>>>> then H has made a correct decision on this input.
>>>>
>>>>
>>>
>>> Yes, you may have defined a 'My code needed to abort the execution of
>>> this program to stop it' decider, but that is not the same thing as a
>>> 'Halting' Decider, so has no bearing on theorems about halting.
>>
>> Since H does divide all of its inputs into {halting and not-halting}**
>> it is a halt decider.
>>
>> **The Halting problem is a problem in computer science.
>> The problem is looking at a computer program and finding
>> out if the program is going to run forever or not. We say
>> that a program "solves the halting problem" if it can
>> look at any other program and tell if that other program
>> will run forever or not.
>> https://simple.wikipedia.org/wiki/Halting_problem
>>
>>
>
> Except that it doesn't divide on Halting, it divides based on its own
> (incorrect) opinion of needing to abort, with a definition of aborting
> (because it is not based on actual need, but its own opinion of need)
> that differs from non-halting.
>
// Linz H with some of the ⊢* states shown
08 bool H(u32 P, u32 I) // Page 318
09 {
10 bool Halted = false;
11 bool Aborted = false;
12 while (!Halted && !Aborted)
13 {
14 Halted = DebugStep(P, I);
15 Aborted = Needs_To_Be_Aborted();
16 }
17 return !Aborted;
18 }
When we remove line 15 all of the inputs that would have been decided to
be not halting prove that they are indeed not halting by the fact that
they fail to ever halt when line 15 is removed.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-11-13 15:54 +0000 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <87sg9dntfq.fsf@bsb.me.uk> |
| In reply to | #25214 |
olcott <NoOne@NoWhere.com> writes:
> On 11/13/2020 5:17 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> When-so-ever UTM halt decider H decides that:
>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>> and
>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>> then H has made a correct not-halting decision on this input.
>>
>> And, in a separate point to André's, I encourage you to post this mantra
>> every time you write about this topic because it makes it crystal clear
>> that you are not talking about the halting problem.
>>
>> The correct return from H for the input <<P>, I> is true if P(I) is a
>> finite computation and false otherwise. That is the halting problem.
>> P(I) is a finite computation even if it includes a call to H that "had
>> to stop it". P(I) is a finite computation even if that is the /only/
>> reason for it being one. P(I) is a finite computation if the execution
>> is finite regardless of the reason or mechanism.
>>
>
> Since it does divide all of its inputs into {halting and not-halting}
> it is a halt decider.
Every decider does that is you label the two conditions "halting" and
"not-halting". Your labels are wrong. Finite (AKA halting)
computations are put into the "not-halting" category. You know this.
You do not dispute the facts of the matter.
Your attempt to re-define what the right answer is won't wash. Move on.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-11-12 15:23 +0000 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <87k0uqr43a.fsf@bsb.me.uk> |
| In reply to | #25178 |
Here is the code for reference:
01 void H_Hat(u32 P)
02 {
03 if (H(P, P))
04 HERE: goto HERE;
05 else
06 HALT
07 }
08 bool H(u32 P, u32 I)
09 {
10 bool Halted = false;
11 bool Aborted = false;
12 while (!Halted && !Aborted)
13 {
14 Halted = DebugStep(P, I);
15 Aborted = Needs_To_Be_Aborted();
16 }
17 return !Aborted;
18 }
olcott <NoOne@NoWhere.com> writes:
> On 11/11/2020 8:08 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>> On 11/11/2020 7:06 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
<cut>
>>>>> The problem is exactly the same the only thing that has changed is the
>>>>> criterion measure that defines the set of halting and not-halting
>>>>> computations.
>>>>
>>>> This is one of the silliest things you have every said, and that is a
>>>> high bar. You don't get to re-define what a halting computation is.
>>>>
>>>> H(H_Hat, H_Hat) is false but H_Hat(H_Hat) is a finite computation. Move
>>>> on.
>>>
>>> So in other words you are saying that:
>>>
>>> A computation that would never halt unless forced to halt would halt
>>> without being forced to halt?
>>
>> No. There are no hypotheticals ("would...", "would not...") in my
>> statement. You can not possibly fail to understand these two simple
>> facts:
>>
>> (1) H(H_Hat, H_Hat) is false
>
> It is an easily verified fact that the above computation would never
> halt unless the halt decider forces it to halt. Do you deny this
> verified fact?
Yes, I deny it. "The above computation" halts (according to you). The
computation that does not halt is a slightly different one in which H is
not even a decider. The halting problem is about whether computations
are or are not finite. It is not about what they "would do" if there
were not exactly as written. That's just a sightly sneaky way to talk
about a different computation as it were the one whose halting is being
assessed.
But really, you have been quite clear. There is no lack of
understanding here, even on your part. You know that H(H_Hat, H_Hat)
being false is the wrong answer when H_Hat(H_Hat) is a finite
computation. That is why you have had to come up with a different
criterion to assess correctness. But it's boring. No one cares about
what a computation "would do" were it not exactly as presented.
Your attempt to label this slightly different computation as "the above
computation" is, I admit, a little deceptive, but its not really
dishonest. I suspect it's just sloppy wording (or sloppy thinking);
certainly no one is taken in by it.
>> (2) H_Hat(H_Hat) is a finite computation
The non-finite computation is the one where line 15 is either not
present or ineffective.
>> They show that H is wrong about that one case. Redefining what the
>> right answer is is just pathetic.
>>
>> (I've started to avoid saying "halting computation" preferring "finite
>> computation" instead simply because of your pathetic ruse to redefine
>> what a halting computation is. In the end, all discussions with cranks
>> end up in a mess of re-defined words.)
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-12 09:30 -0600 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <GsWdnfFk-ZSuyDDCnZ2dnUU7-WXNnZ2d@giganews.com> |
| In reply to | #25192 |
On 11/12/2020 9:23 AM, Ben Bacarisse wrote:
>
> Here is the code for reference:
>
> 01 void H_Hat(u32 P)
> 02 {
> 03 if (H(P, P))
> 04 HERE: goto HERE;
> 05 else
> 06 HALT
> 07 }
>
> 08 bool H(u32 P, u32 I)
> 09 {
> 10 bool Halted = false;
> 11 bool Aborted = false;
> 12 while (!Halted && !Aborted)
> 13 {
> 14 Halted = DebugStep(P, I);
> 15 Aborted = Needs_To_Be_Aborted();
> 16 }
> 17 return !Aborted;
> 18 }
>
> olcott <NoOne@NoWhere.com> writes:
>> On 11/11/2020 8:08 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>> On 11/11/2020 7:06 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
> <cut>
>>>>>> The problem is exactly the same the only thing that has changed is the
>>>>>> criterion measure that defines the set of halting and not-halting
>>>>>> computations.
>>>>>
>>>>> This is one of the silliest things you have every said, and that is a
>>>>> high bar. You don't get to re-define what a halting computation is.
>>>>>
>>>>> H(H_Hat, H_Hat) is false but H_Hat(H_Hat) is a finite computation. Move
>>>>> on.
>>>>
>>>> So in other words you are saying that:
>>>>
>>>> A computation that would never halt unless forced to halt would halt
>>>> without being forced to halt?
>>>
>>> No. There are no hypotheticals ("would...", "would not...") in my
>>> statement. You can not possibly fail to understand these two simple
>>> facts:
>>>
>>> (1) H(H_Hat, H_Hat) is false
>>
>> It is an easily verified fact that the above computation would never
>> halt unless the halt decider forces it to halt. Do you deny this
>> verified fact?
>
> Yes, I deny it. "The above computation" halts (according to you).
When you slightly change the criterion measure to try to get away the
straw-man fallacy https://en.wikipedia.org/wiki/Straw_man gullible
people might believe that your logical error is an actual rebuttal.
--
Copyright 2020 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 | 2020-11-12 11:19 -0500 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <8gdrH.425508$575.87152@fx38.iad> |
| In reply to | #25194 |
On 11/12/20 10:30 AM, olcott wrote: > > When you slightly change the criterion measure to try to get away the > straw-man fallacy https://en.wikipedia.org/wiki/Straw_man gullible > people might believe that your logical error is an actual rebuttal. But isn't your WHOLE argument based on changing the criterion of the halting problem slightly? Does this mean you admit to the Straw_man fallicy?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-12 10:36 -0600 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <pvCdneQR9tLs-TDCnZ2dnUU7-cPNnZ2d@giganews.com> |
| In reply to | #25195 |
On 11/12/2020 10:19 AM, Richard Damon wrote:
> On 11/12/20 10:30 AM, olcott wrote:
>>
>> When you slightly change the criterion measure to try to get away the
>> straw-man fallacy https://en.wikipedia.org/wiki/Straw_man gullible
>> people might believe that your logical error is an actual rebuttal.
>
> But isn't your WHOLE argument based on changing the criterion of the
> halting problem slightly? Does this mean you admit to the Straw_man fallicy?
>
That depends on the answer to this question:
If the following criteria:
Does the input <P> simulated on its input I by decider UTM H have to be
forced to stop executing by H to prevent its infinite execution?
Divides its set of inputs into {halting, not-halting} then this criteria
defines a halt decider.
--
Copyright 2020 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 | 2020-11-12 12:47 -0500 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <vyerH.425512$575.79339@fx38.iad> |
| In reply to | #25198 |
On 11/12/20 11:36 AM, olcott wrote:
> On 11/12/2020 10:19 AM, Richard Damon wrote:
>> On 11/12/20 10:30 AM, olcott wrote:
>>>
>>> When you slightly change the criterion measure to try to get away the
>>> straw-man fallacy https://en.wikipedia.org/wiki/Straw_man gullible
>>> people might believe that your logical error is an actual rebuttal.
>>
>> But isn't your WHOLE argument based on changing the criterion of the
>> halting problem slightly? Does this mean you admit to the Straw_man
>> fallicy?
>>
>
> That depends on the answer to this question:
>
> If the following criteria:
>
> Does the input <P> simulated on its input I by decider UTM H have to be
> forced to stop executing by H to prevent its infinite execution?
>
> Divides its set of inputs into {halting, not-halting} then this criteria
> defines a halt decider.
>
If the definition of 'Have to be abort' REALLY does mean, that the
described Machine (and not just the simulator) would run forever, than
the phrases could be argued to mean the same thing.
Since it is clear that this is NOT the definition you are using, then
you should admit that your whole argument is a straw man, as you are not
refuting Linz based on the definitions that Linz uses, and thus you are
trying to show the possible existence of something that Linz is not
talking about. This is clear as you insist that your machine was correct
in 'needing' to abort because it did, even when the machine given as an
input is actually run, it will halt by itself.
Linz's proof has NOTHING to do with what the internals of the halt
decider might or might not have done, and in fact it can not, because
then it would be constraining what sort of halt deciders (as defined by
the general community of Mathematics and Computer Science) it would
apply to. It only looks at the output of the halt decider, and the
actual behavior of the machine in question.
Your reasoning conflates different levels of the operation, yes, within
the simulation it had to abort something, but that wasn't because the
machine it was simulating had infinite execution itself, but because the
simulator you designed was unable to handle the recursive nature of
H_Hat, and thus to meet ITS requirements of finite execution it
terminated the simulation.
Note, you could ligitemately claim to have a PARTIAL halt decider, that
on detecting this sort of recursion comes back with an 'I Can't Decide
this case', but this would still not refute Linz, as Linz specifically
directs the proof at the non-existence of a Universal Halt Decider.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-11-12 12:21 -0800 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <5fe7ab2c-cbfb-4f0d-9823-1452c582a609n@googlegroups.com> |
| In reply to | #25200 |
On Thursday, 12 November 2020 at 17:47:12 UTC, Richard Damon wrote: > > Linz's proof has NOTHING to do with what the internals of the halt > decider might or might not have done, and in fact it can not, because > then it would be constraining what sort of halt deciders (as defined by > the general community of Mathematics and Computer Science) it would > apply to. > H has to be a Turing machine. If the halt decider is not a Turing machine, the proof fails.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-12 22:48 -0600 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <gZqdncbvF421jTPCnZ2dnUU7-U-dnZ2d@giganews.com> |
| In reply to | #25205 |
On 11/12/2020 2:21 PM, Malcolm McLean wrote: > On Thursday, 12 November 2020 at 17:47:12 UTC, Richard Damon wrote: >> >> Linz's proof has NOTHING to do with what the internals of the halt >> decider might or might not have done, and in fact it can not, because >> then it would be constraining what sort of halt deciders (as defined by >> the general community of Mathematics and Computer Science) it would >> apply to. >> > H has to be a Turing machine. If the halt decider is not a Turing machine, > the proof fails. > When-so-ever UTM halt decider H decides that: (1) its input (<P>,I) would never halt unless H stopped simulating it and (2) its input (<P>,I) would never halt unless H stopped simulating it then H has made a correct not-halting decision on this input. -- Copyright 2020 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-12 22:11 -0600 |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V5) (verified facts) |
| Message-ID | <gOSdncNLKp8ZmjPCnZ2dnUU7-Y_NnZ2d@giganews.com> |
| In reply to | #25200 |
On 11/12/2020 11:47 AM, Richard Damon wrote:
> On 11/12/20 11:36 AM, olcott wrote:
>> On 11/12/2020 10:19 AM, Richard Damon wrote:
>>> On 11/12/20 10:30 AM, olcott wrote:
>>>>
>>>> When you slightly change the criterion measure to try to get away the
>>>> straw-man fallacy https://en.wikipedia.org/wiki/Straw_man gullible
>>>> people might believe that your logical error is an actual rebuttal.
>>>
>>> But isn't your WHOLE argument based on changing the criterion of the
>>> halting problem slightly? Does this mean you admit to the Straw_man
>>> fallicy?
>>>
>>
>> That depends on the answer to this question:
>>
>> If the following criteria:
>>
>> Does the input <P> simulated on its input I by decider UTM H have to be
>> forced to stop executing by H to prevent its infinite execution?
>>
>> Divides its set of inputs into {halting, not-halting} then this criteria
>> defines a halt decider.
>>
>
> If the definition of 'Have to be abort' REALLY does mean, that the
> described Machine (and not just the simulator) would run forever, than
> the phrases could be argued to mean the same thing.
Do you understand that H <is> a UTM that executes <H_Hat> only by
simulating it?
Do you understand that when H_Hat calls H() with input that it is
invoking the UTM with this input to be simulated?
Do you understand the computer science that a the machine description of
a machine <P> executed by a UTM is defined to be an equivalent
computation to the machine execution P ?
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [standalone]
Page 2 of 2 — ← Prev page 1 [2]
Back to top | Article view | comp.theory
csiph-web