• Purpose of this group?

    From Dan Cross@21:1/5 to All on Mon Feb 12 01:22:35 2024
    What is the purpose of this group?

    From what I can tell, it's all this olcott person, who by any
    reasonable indication is a crank, posting nonsense, and a bunch
    of people responding to him. However, by responding to him over
    and over again (and largely saying the same thing ad nauseum),
    they themselves are also starting to appear more and more like
    cranks.

    Honestly, do any of you expect a different outcome? Do you
    expect olcott to admit that he's wrong, even though it's so
    obvious?

    Why not just stop responding to him? Perhaps even post an FAQ
    stating that he's a crank and to ignore him? I plonked the guy
    ages ago, but still get all the backscatter of people responding
    to him over and over saying the same thing again and again.

    - Dan C.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From immibis@21:1/5 to Dan Cross on Mon Feb 12 02:59:07 2024
    On 12/02/24 02:22, Dan Cross wrote:
    What is the purpose of this group?

    From what I can tell, it's all this olcott person, who by any
    reasonable indication is a crank, posting nonsense, and a bunch
    of people responding to him. However, by responding to him over
    and over again (and largely saying the same thing ad nauseum),
    they themselves are also starting to appear more and more like
    cranks.

    Honestly, do any of you expect a different outcome? Do you
    expect olcott to admit that he's wrong, even though it's so
    obvious?

    Why not just stop responding to him? Perhaps even post an FAQ
    stating that he's a crank and to ignore him? I plonked the guy
    ages ago, but still get all the backscatter of people responding
    to him over and over saying the same thing again and again.

    - Dan C.


    Found the party pooper. It's not like anyone else is trying to talk
    about anything else - most of Usenet is dead - if you don't find this
    funny then set your client to automatically ignore all subthreads
    started by him.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From immibis@21:1/5 to olcott on Mon Feb 12 02:59:56 2024
    XPost: sci.logic

    On 12/02/24 02:40, olcott wrote:
    On 2/11/2024 7:22 PM, Dan Cross wrote:
    What is the purpose of this group?

     From what I can tell, it's all this olcott person, who by any
    reasonable indication is a crank, posting nonsense, and a bunch
    of people responding to him.  However, by responding to him over
    and over again (and largely saying the same thing ad nauseum),
    they themselves are also starting to appear more and more like
    cranks.

    Honestly, do any of you expect a different outcome?  Do you
    expect olcott to admit that he's wrong, even though it's so
    obvious?

    Why not just stop responding to him?  Perhaps even post an FAQ
    stating that he's a crank and to ignore him?  I plonked the guy
    ages ago, but still get all the backscatter of people responding
    to him over and over saying the same thing again and again.

        - Dan C.


    Two PhD computer science professors independently derived
    one of my two proofs, thus proving that I am not a crank.
    It is the proof that they agree with that I have been presenting

    *The Halting Paradox* Bill Stoddart (2017)
    https://arxiv.org/abs/1906.05340

    *Objective and Subjective Specifications* Eric C.R. Hehner (2017) https://www.cs.toronto.edu/~hehner/OSS.pdf

    *Problems with the Halting Problem* Eric C.R. Hehner (2011) https://www.cs.toronto.edu/~hehner/PHP.pdf


    no they did not

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From immibis@21:1/5 to olcott on Mon Feb 12 04:50:16 2024
    XPost: sci.logic

    On 12/02/24 03:11, olcott wrote:
    On 2/11/2024 7:59 PM, immibis wrote:
    On 12/02/24 02:40, olcott wrote:
    On 2/11/2024 7:22 PM, Dan Cross wrote:
    What is the purpose of this group?

     From what I can tell, it's all this olcott person, who by any
    reasonable indication is a crank, posting nonsense, and a bunch
    of people responding to him.  However, by responding to him over
    and over again (and largely saying the same thing ad nauseum),
    they themselves are also starting to appear more and more like
    cranks.

    Honestly, do any of you expect a different outcome?  Do you
    expect olcott to admit that he's wrong, even though it's so
    obvious?

    Why not just stop responding to him?  Perhaps even post an FAQ
    stating that he's a crank and to ignore him?  I plonked the guy
    ages ago, but still get all the backscatter of people responding
    to him over and over saying the same thing again and again.

        - Dan C.


    Two PhD computer science professors independently derived
    one of my two proofs, thus proving that I am not a crank.
    It is the proof that they agree with that I have been presenting

    *The Halting Paradox* Bill Stoddart (2017)
    https://arxiv.org/abs/1906.05340

    *Objective and Subjective Specifications* Eric C.R. Hehner (2017)
    https://www.cs.toronto.edu/~hehner/OSS.pdf

    *Problems with the Halting Problem* Eric C.R. Hehner (2011)
    https://www.cs.toronto.edu/~hehner/PHP.pdf


    no they did not

    *Here are the details of how they did* https://www.researchgate.net/publication/374806722_Does_the_halting_problem_place_an_actual_limit_on_computation


    This has nothing to do with the halting problem since you are about
    meanings of English words, but the halting problem is mathematical. It
    is like proving that 1+1=3 because one and one make three because they
    can go into a house, reproduce, and come out as three.

    The halting problem is not about specifications, or context-dependent functions. It is simply about whether a Turing machine/input pair has a
    finite configuration sequence.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to Dan Cross on Mon Feb 12 13:20:14 2024
    On 2024-02-12 01:22:35 +0000, Dan Cross said:

    What is the purpose of this group?

    From what I can tell, it's all this olcott person, who by any
    reasonable indication is a crank, posting nonsense, and a bunch
    of people responding to him. However, by responding to him over
    and over again (and largely saying the same thing ad nauseum),
    they themselves are also starting to appear more and more like
    cranks.

    What other purpose would you want to use this group?

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Dan Cross@21:1/5 to mikko.levanto@iki.fi on Mon Feb 12 13:14:43 2024
    In article <uqcute$1fhr2$1@dont-email.me>, Mikko <mikko.levanto@iki.fi> wrote: >On 2024-02-12 01:22:35 +0000, Dan Cross said:

    What is the purpose of this group?

    From what I can tell, it's all this olcott person, who by any
    reasonable indication is a crank, posting nonsense, and a bunch
    of people responding to him. However, by responding to him over
    and over again (and largely saying the same thing ad nauseum),
    they themselves are also starting to appear more and more like
    cranks.

    What other purpose would you want to use this group?

    Perhaps serious discussions of theoretical computer science?

    Sadly, this does not appear possible. I see that this thread
    has already devolved into arguments with olcott about his
    specious claims.

    - Dan C.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to Dan Cross on Mon Feb 12 19:46:14 2024
    On 2024-02-12 13:14:43 +0000, Dan Cross said:

    In article <uqcute$1fhr2$1@dont-email.me>, Mikko <mikko.levanto@iki.fi> wrote:
    On 2024-02-12 01:22:35 +0000, Dan Cross said:

    What is the purpose of this group?

    From what I can tell, it's all this olcott person, who by any
    reasonable indication is a crank, posting nonsense, and a bunch
    of people responding to him. However, by responding to him over
    and over again (and largely saying the same thing ad nauseum),
    they themselves are also starting to appear more and more like
    cranks.

    What other purpose would you want to use this group?

    Perhaps serious discussions of theoretical computer science?
    Sadly, this does not appear possible.

    You can always start a serious discussion. Of course, it is possible
    that nobody else wants to discuss seriously. But it is also possible
    that someone does. You are likely to get replies that do not contribute
    to the serious discussion but you needn't to respond to them or even
    to read them more than needed to determine their unimportance.

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From immibis@21:1/5 to olcott on Mon Feb 12 19:29:51 2024
    XPost: sci.logic

    On 12/02/24 05:10, olcott wrote:
    On 2/11/2024 9:50 PM, immibis wrote:
    On 12/02/24 03:11, olcott wrote:
    On 2/11/2024 7:59 PM, immibis wrote:
    On 12/02/24 02:40, olcott wrote:
    On 2/11/2024 7:22 PM, Dan Cross wrote:
    What is the purpose of this group?

     From what I can tell, it's all this olcott person, who by any
    reasonable indication is a crank, posting nonsense, and a bunch
    of people responding to him.  However, by responding to him over
    and over again (and largely saying the same thing ad nauseum),
    they themselves are also starting to appear more and more like
    cranks.

    Honestly, do any of you expect a different outcome?  Do you
    expect olcott to admit that he's wrong, even though it's so
    obvious?

    Why not just stop responding to him?  Perhaps even post an FAQ
    stating that he's a crank and to ignore him?  I plonked the guy
    ages ago, but still get all the backscatter of people responding
    to him over and over saying the same thing again and again.

        - Dan C.


    Two PhD computer science professors independently derived
    one of my two proofs, thus proving that I am not a crank.
    It is the proof that they agree with that I have been presenting

    *The Halting Paradox* Bill Stoddart (2017)
    https://arxiv.org/abs/1906.05340

    *Objective and Subjective Specifications* Eric C.R. Hehner (2017)
    https://www.cs.toronto.edu/~hehner/OSS.pdf

    *Problems with the Halting Problem* Eric C.R. Hehner (2011)
    https://www.cs.toronto.edu/~hehner/PHP.pdf


    no they did not

    *Here are the details of how they did*
    https://www.researchgate.net/publication/374806722_Does_the_halting_problem_place_an_actual_limit_on_computation


    This has nothing to do with the halting problem since you are about
    meanings of English words, but the halting problem is mathematical. It
    is like proving that 1+1=3 because one and one make three because they
    can go into a house, reproduce, and come out as three.

    The halting problem is not about specifications, or context-dependent
    functions. It is simply about whether a Turing machine/input pair has
    a finite configuration sequence.

    *In other words you see how these professors agree with me*


    They don't agree with you.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From immibis@21:1/5 to olcott on Mon Feb 12 20:23:25 2024
    XPost: sci.logic

    On 12/02/24 19:43, olcott wrote:
    On 2/12/2024 12:29 PM, immibis wrote:
    On 12/02/24 05:10, olcott wrote:
    On 2/11/2024 9:50 PM, immibis wrote:
    On 12/02/24 03:11, olcott wrote:
    On 2/11/2024 7:59 PM, immibis wrote:
    On 12/02/24 02:40, olcott wrote:
    On 2/11/2024 7:22 PM, Dan Cross wrote:
    What is the purpose of this group?

     From what I can tell, it's all this olcott person, who by any >>>>>>>> reasonable indication is a crank, posting nonsense, and a bunch >>>>>>>> of people responding to him.  However, by responding to him over >>>>>>>> and over again (and largely saying the same thing ad nauseum), >>>>>>>> they themselves are also starting to appear more and more like >>>>>>>> cranks.

    Honestly, do any of you expect a different outcome?  Do you
    expect olcott to admit that he's wrong, even though it's so
    obvious?

    Why not just stop responding to him?  Perhaps even post an FAQ >>>>>>>> stating that he's a crank and to ignore him?  I plonked the guy >>>>>>>> ages ago, but still get all the backscatter of people responding >>>>>>>> to him over and over saying the same thing again and again.

        - Dan C.


    Two PhD computer science professors independently derived
    one of my two proofs, thus proving that I am not a crank.
    It is the proof that they agree with that I have been presenting >>>>>>>
    *The Halting Paradox* Bill Stoddart (2017)
    https://arxiv.org/abs/1906.05340

    *Objective and Subjective Specifications* Eric C.R. Hehner (2017) >>>>>>> https://www.cs.toronto.edu/~hehner/OSS.pdf

    *Problems with the Halting Problem* Eric C.R. Hehner (2011)
    https://www.cs.toronto.edu/~hehner/PHP.pdf


    no they did not

    *Here are the details of how they did*
    https://www.researchgate.net/publication/374806722_Does_the_halting_problem_place_an_actual_limit_on_computation


    This has nothing to do with the halting problem since you are about
    meanings of English words, but the halting problem is mathematical.
    It is like proving that 1+1=3 because one and one make three because
    they can go into a house, reproduce, and come out as three.

    The halting problem is not about specifications, or
    context-dependent functions. It is simply about whether a Turing
    machine/input pair has a finite configuration sequence.

    *In other words you see how these professors agree with me*


    They don't agree with you.

    Any idea can be a mere naysayer.

    Their quoted text in my paper does agree that the halting
    problem cannot be solved only because there is something
    wrong with it.

       The proof of the halting problem assumes a universal
       halt test exists and then provides S as an example of
       a program that the test cannot handle. But S is not a
       program at all. It is not even a conceptual object,
       and this is due to inconsistencies in the specification
       of the halting function. (Stoddart: 2017)



    If it's impossible for a program to solve the halting problem, then the
    halting problem is proven unsolvable.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From immibis@21:1/5 to olcott on Mon Feb 12 20:41:49 2024
    On 12/02/24 19:54, olcott wrote:
    That I and their own (linked) papers agree that the only reason
    the halting problem cannot be solved only because is there is
    something wrong with it is easily verified as factual.

    This is unfactual. None of the papers you linked prove there is anything
    wrong with the halting problem.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From immibis@21:1/5 to olcott on Mon Feb 12 22:40:06 2024
    XPost: sci.logic

    On 12/02/24 21:41, olcott wrote:
    On 2/12/2024 1:41 PM, immibis wrote:
    On 12/02/24 19:54, olcott wrote:
    That I and their own (linked) papers agree that the only reason
    the halting problem cannot be solved only because is there is
    something wrong with it is easily verified as factual.

    This is unfactual. None of the papers you linked prove there is
    anything wrong with the halting problem.

    You can claim that it is unfactual yet the actual facts
    prove that it is factual.

    You can claim that it is factual yet the actual facts prove that it is unfactual.

    *Try and show how this means that there is nothing*
    *wrong with the halting problem specification >
    The proof of the halting problem assumes a universal
    halt test exists and then provides S as an example of
    a program that the test cannot handle. But S is not a
    program at all. It is not even a conceptual object, and
    this is due to *inconsistencies in the specification* of
    the halting function. (Stoddart: 2017:8)


    When we are talking about the halting problem for Turing machines, S is
    a Turing machine because it meets the criteria for being a Turing
    machine. There are no "hidden criteria".

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From immibis@21:1/5 to olcott on Tue Feb 13 00:10:28 2024
    XPost: sci.logic

    On 12/02/24 22:45, olcott wrote:
    On 2/12/2024 3:40 PM, immibis wrote:
    When we are talking about the halting problem for Turing machines, S
    is a Turing machine because it meets the criteria for being a Turing
    machine. There are no "hidden criteria".


    The question is not whether you agree with Stoddart. The question
    whether Stoddart agrees with me,

    How very self-centered of you. No matter what you think about Stoddart,
    the fact remains: S is a Turing machine because it meets the criteria
    for being a Turing machine. There are no "hidden criteria".

    that the halting problem cannot
    be solved because there is something wrong with it

    There is nothing wrong with problems that cannot be solved, except that
    they cannot be solved, which is a problem to people who want to solve them.

    *inconsistencies in the specification*
    says there is something wrong with it.

    That you do not understand the halting problem does not prove there is
    an inconsistency in it.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to Dan Cross on Tue Feb 13 00:32:34 2024
    cross@spitfire.i.gajendra.net (Dan Cross) writes:

    What is the purpose of this group?

    From what I can tell, it's all this olcott person, who by any
    reasonable indication is a crank, posting nonsense, and a bunch
    of people responding to him. However, by responding to him over
    and over again (and largely saying the same thing ad nauseum),
    they themselves are also starting to appear more and more like
    cranks.

    As one who has replied (quite a lot) I will offer two defences. (1) I
    tried (and I feel I succeeded) in trying to pin down explicitly what
    form of nonsense was being espoused. (2) I stopped.

    Honestly, do any of you expect a different outcome? Do you
    expect olcott to admit that he's wrong, even though it's so
    obvious?

    Why not just stop responding to him? Perhaps even post an FAQ
    stating that he's a crank and to ignore him? I plonked the guy
    ages ago, but still get all the backscatter of people responding
    to him over and over saying the same thing again and again.

    It's gone crazy but, sadly, I doubt there is anyone left who wants to
    discuss comp.theory in comp.theory.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Mon Feb 12 21:09:50 2024
    XPost: sci.logic

    On 2/12/24 1:43 PM, olcott wrote:
    On 2/12/2024 12:29 PM, immibis wrote:
    On 12/02/24 05:10, olcott wrote:
    On 2/11/2024 9:50 PM, immibis wrote:
    On 12/02/24 03:11, olcott wrote:
    On 2/11/2024 7:59 PM, immibis wrote:
    On 12/02/24 02:40, olcott wrote:
    On 2/11/2024 7:22 PM, Dan Cross wrote:
    What is the purpose of this group?

     From what I can tell, it's all this olcott person, who by any >>>>>>>> reasonable indication is a crank, posting nonsense, and a bunch >>>>>>>> of people responding to him.  However, by responding to him over >>>>>>>> and over again (and largely saying the same thing ad nauseum), >>>>>>>> they themselves are also starting to appear more and more like >>>>>>>> cranks.

    Honestly, do any of you expect a different outcome?  Do you
    expect olcott to admit that he's wrong, even though it's so
    obvious?

    Why not just stop responding to him?  Perhaps even post an FAQ >>>>>>>> stating that he's a crank and to ignore him?  I plonked the guy >>>>>>>> ages ago, but still get all the backscatter of people responding >>>>>>>> to him over and over saying the same thing again and again.

        - Dan C.


    Two PhD computer science professors independently derived
    one of my two proofs, thus proving that I am not a crank.
    It is the proof that they agree with that I have been presenting >>>>>>>
    *The Halting Paradox* Bill Stoddart (2017)
    https://arxiv.org/abs/1906.05340

    *Objective and Subjective Specifications* Eric C.R. Hehner (2017) >>>>>>> https://www.cs.toronto.edu/~hehner/OSS.pdf

    *Problems with the Halting Problem* Eric C.R. Hehner (2011)
    https://www.cs.toronto.edu/~hehner/PHP.pdf


    no they did not

    *Here are the details of how they did*
    https://www.researchgate.net/publication/374806722_Does_the_halting_problem_place_an_actual_limit_on_computation


    This has nothing to do with the halting problem since you are about
    meanings of English words, but the halting problem is mathematical.
    It is like proving that 1+1=3 because one and one make three because
    they can go into a house, reproduce, and come out as three.

    The halting problem is not about specifications, or
    context-dependent functions. It is simply about whether a Turing
    machine/input pair has a finite configuration sequence.

    *In other words you see how these professors agree with me*


    They don't agree with you.

    Any idea can be a mere naysayer.

    Their quoted text in my paper does agree that the halting
    problem cannot be solved only because there is something
    wrong with it.

       The proof of the halting problem assumes a universal
       halt test exists and then provides S as an example of
       a program that the test cannot handle. But S is not a
       program at all. It is not even a conceptual object,
       and this is due to inconsistencies in the specification
       of the halting function. (Stoddart: 2017)



    But he is wrong, because S HAS been completely specified.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From immibis@21:1/5 to olcott on Wed Feb 14 05:09:08 2024
    XPost: sci.logic

    On 13/02/24 02:43, olcott wrote:
    On 2/12/2024 5:10 PM, immibis wrote:

    There is nothing wrong with problems that cannot be solved, except
    that they cannot be solved, which is a problem to people who want to
    solve them.


    According to that reasoning I can correctly determine that you
    must be stupid when you cannot correctly answer this question:
    What time is it (yes or no)?

    What?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From immibis@21:1/5 to olcott on Wed Feb 14 05:08:35 2024
    XPost: sci.logic

    On 13/02/24 02:46, olcott wrote:
    On 2/12/2024 5:10 PM, immibis wrote:
    On 12/02/24 22:47, olcott wrote:
    On 2/12/2024 3:40 PM, immibis wrote:
    On 12/02/24 21:29, olcott wrote:

    It is also equally impossible to determine whether
    "this sentence is not true" is true or false and both
    math and computer science don't understand that this
    impossibility does not limit math or computer science.


    "This sentence is not true" is not a Turing machine/input pair. All
    Turing machine/input pairs have finite or infinite execution sequences. >>>
    "this sentence is not true" is the math side of the
    incorrect notion of undecidability.

    "this sentence is not true" is not math.

    Yet this formalized version <is> the basis of Tarski's proof.

    Tarski proved it cannot be formalized.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)