• Re: buckle-up chucklefucks....

    From Chris M. Thomasson@chris.m.thomasson.1@gmail.com to comp.theory,sci.logic,sci.math,alt.buddha.short.fat.guy,alt.messianic on Mon Nov 9 18:30:55 2026
    From Newsgroup: comp.theory

    On 9/30/2026 7:39 PM, Dude wrote:
    On 9/30/2026 10:50 AM, Chris M. Thomasson wrote:
    On 9/30/2026 9:36 AM, Dude wrote:
    On 9/30/2026 12:23 AM, Chris M. Thomasson wrote:
    On 9/28/2026 9:47 PM, dart200 wrote:
    On 9/28/26 3:00 PM, Chris M. Thomasson wrote:
    On 9/24/2026 6:16 PM, dart200 wrote:
    On 9/24/26 4:35 PM, Chris M. Thomasson wrote:
    On 9/24/2026 3:44 PM, dart200 wrote:
    On 9/24/26 3:10 PM, Chris M. Thomasson wrote:
    On 9/20/2026 10:39 PM, dart200 wrote:
    On 9/20/26 7:51 PM, Chris M. Thomasson wrote:
    On 9/20/2026 7:11 PM, dart200 wrote:
    On 9/20/26 2:53 PM, Chris M. Thomasson wrote:
    On 9/19/2026 2:38 PM, dart200 wrote:
    [...]
    If not, wtf! You remind me of PO. Sorry for that cut. >>>>>>>>>>>>>>>
    i don't care for ur fallacy by association brainrot >>>>>>>>>>>>>>
    Sigh. I only said you kind of do remind me of the way PO >>>>>>>>>>>>>> dealt with the halting program.

    and that statement has no bearing on the correctness of my >>>>>>>>>>>>> arguments, u brain-rotted boomer


    You cannot predict a random number and you cannot solve the >>>>>>>>>>>> halting problem. Sigh.

    turing machines do not involve random numbers dud. if u knew >>>>>>>>>>> literally anything about basic computing theory u'd know that. >>>>>>>>>>>
    but u don't, so go back to ur fractals, eh?

    Well, ponder on CSPRNG?

    pseudo-random number generators are fully deterministic and >>>>>>>>> therefore entirely decidable in terms of whether it the machine >>>>>>>>> which produces it is circle-free or not (they are obviously). >>>>>>>>> for any decision ofc one needs a description of the machine >>>>>>>>> including any input (like a seed), and that combination can be >>>>>>>>> used to decide on the semantics of the described computation >>>>>>>>>
    when u say "random" that does not describe what can be produced >>>>>>>>> by a turing machine, as they can only compute pseudo-random >>>>>>>>> sequences that are inherently predictable, not truly random >>>>>>>>> ones. if u meant pseudo- random you should have said that... >>>>>>>>>
    seriously, bro: back to ur fractals, eh?


    You have no idea how to get around the halting problem.

    u have no idea what the halting problem even is, or the paradox >>>>>>> that makes it undecidable

    and why anyone else isn't correcting u is just beyond me


    PO, its okay. We know way more about it. But, you already know
    about that? Right? If not. WOW!

    lol go back to ur fractals dud


    Remember my fuzzer code I made in AppleSoft BASIC? It only halts
    once every path of the program under question has been hit. This is
    NOT saying I solved the halting program, but its fun none the less,
    well according to me. ;^)

    The main thing is that you halted the input of BASIC into a text
    editor for your own amusement, and you realized how boring it would
    be doing that for a living somewhere in a dank basement for the rest
    of your life. YMMV.


    It fuzzes the program until all paths are hit. Once that occurs, it
    halts.

    Now you can write your paper and self-publish for review on Usenet.
    Now get to work, Chris!



    ;^) Fwiw, I wrote about it in this group. Just a fun way to fuzz a
    program. It does not give a shit if it goes on forever or halts
    because all possible paths were hit. It keeps a counter for every path
    it finds during static analysis on the program source code. So, it
    tries to fuzz all on the conditionals. One counter per path. When all
    counters are non-zero, it says, we can halt for this accounting.
    That's all. Actually, fuzzing is fairly helpful for testing things... :^)

    This s good news!

    This group has been needing a compiler ever since Ned passed away. Keep
    up the good work!


    Simply if we cannot hit all paths of a program, well, shit happens!

    Like I was telling Noah, it's not a matter of if we get hacked - its
    just a matter of when.

    There is a private dancer for any program, well, not a TRNG, but fun as
    well!

    https://youtu.be/d4QnalIHlVc?list=RDd4QnalIHlVc
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Chris M. Thomasson@chris.m.thomasson.1@gmail.com to comp.theory,sci.logic,sci.math,alt.buddha.short.fat.guy,alt.messianic on Mon Nov 9 18:33:08 2026
    From Newsgroup: comp.theory

    On 10/2/2026 11:24 AM, dart200 wrote:
    On 10/2/26 3:19 AM, Chris M. Thomasson wrote:
    On 10/1/2026 8:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? If so, so
    what?

    it is solvable for an enumerable set of machines that includes all
    possible output sequences, it is not solvable for all possible machines


    Well, we know a program A can decide for a program B. But there exists
    infinity many programs that cannot decide for B.

    which is fine because those infinitely many machines do not contain a sequence outside the enumeration i proved effectively decidable

    there is no practical need to utilize infinite languages to compute
    things dud, we only actually need _one_ turing complete language to do
    it ... and we can form one which is both effectively decidable and
    includes all possible output sequence!

    which my god is such a refreshing to prove, we really do utilize far to
    many programming languages for no good reason tbh


    Interesting...
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Chris M. Thomasson@chris.m.thomasson.1@gmail.com to comp.theory on Mon Nov 9 18:34:00 2026
    From Newsgroup: comp.theory

    On 9/29/2026 2:43 AM, Alan Mackenzie wrote:
    [ Followup-To: set ]

    In comp.theory Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote:
    On 9/24/2026 3:45 PM, dart200 wrote:
    On 9/24/26 3:21 PM, Chris M. Thomasson wrote:

    [ .... ]

    You really are PO! ;^o Woha!

    i really am not polcott,

    Are you sure? You two are very much, alike.

    If you'd read any great deal of both of them, you would see straight
    away they're not the same poster.

    You've repeated that assertion so much it's in danger of becoming spam.

    [ .... ]


    Touche.
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From dart200@user7160@newsgrouper.org.invalid to comp.theory,sci.logic,sci.math,alt.buddha.short.fat.guy,alt.messianic on Mon Nov 9 22:04:12 2026
    From Newsgroup: comp.theory

    On 11/9/26 6:33 PM, Chris M. Thomasson wrote:
    On 10/2/2026 11:24 AM, dart200 wrote:
    On 10/2/26 3:19 AM, Chris M. Thomasson wrote:
    On 10/1/2026 8:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? If so, so
    what?

    it is solvable for an enumerable set of machines that includes all
    possible output sequences, it is not solvable for all possible machines >>>>

    Well, we know a program A can decide for a program B. But there
    exists infinity many programs that cannot decide for B.

    which is fine because those infinitely many machines do not contain a
    sequence outside the enumeration i proved effectively decidable

    there is no practical need to utilize infinite languages to compute
    things dud, we only actually need _one_ turing complete language to do
    it ... and we can form one which is both effectively decidable and
    includes all possible output sequence!

    which my god is such a refreshing to prove, we really do utilize far
    to many programming languages for no good reason tbh


    Interesting...

    unfortunately i have since proven the proof incorrect
    --
    arising us out of the computing dark ages,
    please excuse my pseudo-pyscript,
    ~ the lil crank that could
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Dude@punditster@gmail.com to comp.theory,sci.logic,sci.math,alt.buddha.short.fat.guy,alt.messianic on Tue Nov 10 09:32:18 2026
    From Newsgroup: comp.theory

    On 11/9/2026 6:33 PM, Chris M. Thomasson wrote:
    On 10/2/2026 11:24 AM, dart200 wrote:
    On 10/2/26 3:19 AM, Chris M. Thomasson wrote:
    On 10/1/2026 8:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? If so, so
    what?

    it is solvable for an enumerable set of machines that includes all
    possible output sequences, it is not solvable for all possible machines >>>>

    Well, we know a program A can decide for a program B. But there
    exists infinity many programs that cannot decide for B.

    which is fine because those infinitely many machines do not contain a
    sequence outside the enumeration i proved effectively decidable

    there is no practical need to utilize infinite languages to compute
    things dud, we only actually need _one_ turing complete language to do
    it ... and we can form one which is both effectively decidable and
    includes all possible output sequence!

    which my god is such a refreshing to prove, we really do utilize far
    to many programming languages for no good reason tbh


    Interesting...

    All claims posted to this board will be met in kind.

    We only accept direct perception as a valid means of knowledge. All
    inference, hearsay, speculation, and verbal testimony will not be
    accepted as absolute proof of the existence of anything mind made.

    So, if I don't see it, it's probably just made up.

    Call me skeptical.
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Dude@punditster@gmail.com to comp.theory,sci.logic,sci.math,alt.buddha.short.fat.guy,alt.messianic on Tue Nov 10 09:33:37 2026
    From Newsgroup: comp.theory

    On 11/9/2026 10:04 PM, dart200 wrote:
    On 11/9/26 6:33 PM, Chris M. Thomasson wrote:
    On 10/2/2026 11:24 AM, dart200 wrote:
    On 10/2/26 3:19 AM, Chris M. Thomasson wrote:
    On 10/1/2026 8:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? If so, so >>>>>> what?

    it is solvable for an enumerable set of machines that includes all
    possible output sequences, it is not solvable for all possible
    machines


    Well, we know a program A can decide for a program B. But there
    exists infinity many programs that cannot decide for B.

    which is fine because those infinitely many machines do not contain a
    sequence outside the enumeration i proved effectively decidable

    there is no practical need to utilize infinite languages to compute
    things dud, we only actually need _one_ turing complete language to
    do it ... and we can form one which is both effectively decidable and
    includes all possible output sequence!

    which my god is such a refreshing to prove, we really do utilize far
    to many programming languages for no good reason tbh


    Interesting...

    unfortunately i have since proven the proof incorrect

    The claim you are referring to is entirely false and fabricated,
    originating from a mashup of internet rumors and memes made up by
    informants which have all been refuted and found to be spurious,
    crude, racist and biased - on this very board!

    Call me skeptical
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Dude@punditster@gmail.com to comp.theory,alt.buddha.short.fat.guy,alt.messianic on Tue Nov 10 09:41:42 2026
    From Newsgroup: comp.theory

    On 10/2/2026 11:34 AM, dart200 wrote:
    On 10/2/26 10:18 AM, Dude wrote:
    On 10/2/2026 5:44 AM, Alan Mackenzie wrote:
    [ Followup-To: set ]

    In comp.theory dart200 <user7160@newsgrouper.org.invalid> wrote:
    On 9/30/26 5:47 AM, Alan Mackenzie wrote:
    Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote:
    On 9/29/2026 2:43 AM, Alan Mackenzie wrote:

    [ .... ]

    Why do they [polcott and dart200] seem to act alike?

    What they have in common is a lack of respect for proven mathematics >>>>> and the achievements of great intellects of previous generations.

    acting like the greats can never be wrong is when objectivity turns
    into
    propaganda, alan

    Everybody is wrong from time to time.-a Established mathematics, checked >>> by millions of academics and students is _not_ wrong.-a I think you've
    said, on occasion that, with respect to his published paper, "Turing was >>> wrong".-a It doesn't seem to have occurred to you that, not being a
    trained mathematician, you might simply have misunderstood.-a I know
    which
    way I'd place my bets.

    for the record: turing wrote the most impactful math paper in human
    history. certainly others were great as well, not discrediting them,
    but
    mechanical computing and the ability to imbue discrete logic into
    objects, along with the sheer computational power of those objects, has >>>> clearly has the most significant impact on our progression as a
    species.

    Other mathematicians who came before Turing, many of them, made advances >>> of equal and greater weight.-a Without them, Turing couldn't even have
    got
    started with his 1936 paper.

    narcissistic asshates scrambling for "muh AGI" have little appreciation >>>> for just how miraculous computing already is...

    and i'm _only_ improving on it [ .... ], nothing about my claims even
    remotely diminishes the the significance of his work.

    the fact academics aren't even remotely open the idea truly exemplifies >>>> how broken modern academia is.

    Just as geographers aren't remotely open to the idea that the Earth is
    flat.-a Academia would indeed be broken if they spent most of their time >>> repeatedly refuting cranks.-a Academics work at the frontiers of
    knowledge, not the established basics which cranks delight in
    misunderstanding.

    bureaucrats pushing for endless paper production and "innovation" for
    the sake of fame and ultimately endorsements heavily distorts the
    academic mission of coherent and progressive knowledge production. we
    clearly aren't allowing for the flourishing of human intellect within
    academia anymore, and theoretical progression has mostly ground to a
    halt because of it

    I think that's a wild extrapolation from limited experience.-a How would >>> you understand what is being done in university maths departments
    anyway?

    The question is, Why do they [polcott and dart200] seem to act alike?
    -a-a"You want to deny whatever doesn't fit your carefully thought out
    idea of how things are, lay down your opinions as though they're Holy
    Writ, and remain firmly mired in your delusions and dukkha.

    So enjoy it, worthless asswipe." - Peter Olcott

    Re: Nothing more (was Re: Journey with me toward the consummation of
    incomparable enlightenment)
    Author: Peter Olcott
    Jul 11, 2013
    alt.zen
    alt.philosophy.zen
    alt.philosophy.taoism
    alt.buddha.short.fat.guy

    unlike polcott, i ain't inviting you on a journey towards incomparable enlightenment! cause we both know ur too far gone into the boomer
    brainrot to ever see that happen dud

    Some people just feel better when they have someone to talk to, that
    speaks English.

    Where's Olcott?

    We would like a word with him to try and wrap this up once and for all.
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Dude@punditster@gmail.com to comp.theory,alt.messianic,alt.buddha.short.fat.guy,sci.logic,sci.math on Tue Nov 10 09:56:38 2026
    From Newsgroup: comp.theory

    On 10/3/2026 11:36 AM, dart200 wrote:
    On 10/3/26 10:08 AM, Dude wrote:
    On 10/2/2026 6:36 PM, Chris M. Thomasson wrote:
    On 10/2/2026 1:53 PM, Dude wrote:
    On 10/2/2026 1:38 PM, Chris M. Thomasson wrote:
    On 10/1/2026 5:14 PM, Dude wrote:
    On 10/1/2026 3:47 PM, Chris M. Thomasson wrote:
    On 9/30/2026 8:00 PM, Dude wrote:
    On 9/28/2026 3:08 PM, Chris M. Thomasson wrote:
    On 9/25/2026 11:28 AM, dart200 wrote:
    [...]

    You should read hours of PO nonsense as you are looking into a >>>>>>>>> mirror.

    On 7/29/25 11:12 PM, olcott wrote:

    Re: I have just proven the error of all of the halting problem >>>>>>>> proofs --- breakthrough ?

    https://tinyurl.com/5zn4j9zk

    Odd how they can tend to sound alike from time to time.

    It's even odder for someone to post here about Turing and the
    halting problem, which has been discussed here for decades, and
    never read any
    Peter Olcott halting solutions.

    Agreed.

    Why Peter Olcott is correct
    Author: Mr Flibble
    May 18, 2025
    comp.theory

    In the case of pathological input, Peter's SHD only needs to report a
    correct halting result *as if* the simulation was run to completion:
    whether we abort, or continue until we run out of stack space makes no >>>> difference: we are detecting INFINITE recursion which can be viewed
    as non-halting.

    PO has a lot of errors and misconceptions. He thinks oh my, we stop a
    recursion and say it halted. But, the program never halts. Iirc,
    thats one of his things...

    That's a given.

    Because Nick sounds like he's at least a cousin, if not a brother to
    Peter Olcott and his halting theory. YMMV.

    Now you tell me this: Do, or notes Nick act, look, and sound like a
    nasty, rude, racist like Peter Olcott?

    Nick's paper and Peter's halting problem outline paper, or not?

    Let's compare the two and wrap up this thread for Nick.




    This is valid due to Flibble's Law:

    If a problem permits infinite behavior in its formulation, it permits
    infinite analysis of that behavior in its decidability scope.

    /Flibble



    watching retarded duds riff off each other's idiocy is honestly quite amusing. that's why i don't block u duds, what a total clownshow EfnuEfnuEfnu

    On this board, we only accept direct perception as a valid means of
    knowledge.

    Not, inference, speculation, hearsay. If we don't see it, we probably
    won't believe it, just based on speculation of one single informant
    posting a computational halting theory.

    So, until Peter returns with some verbal testimony, I remain skeptical.

    Let's wrap this up. Boring.

    P.S. Since there's only two respondents posting to Usenet anymore, it
    might be a good time for you to review the FAQ and learn about threaded messaging on Usenet.

    So far, this thread is a total mess, running 1870 line over cross posted
    and snipped ten times, across five boards - a total mishmash of nonsense gibberish.

    Jesus, Nick! You are an embarrassment to all social media texting addicts!

    Hope this helps.


    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From dart200@user7160@newsgrouper.org.invalid to comp.theory,sci.logic,sci.math,alt.buddha.short.fat.guy,alt.messianic on Tue Nov 10 22:50:40 2026
    From Newsgroup: comp.theory

    On 11/10/26 9:33 AM, Dude wrote:
    On 11/9/2026 10:04 PM, dart200 wrote:
    On 11/9/26 6:33 PM, Chris M. Thomasson wrote:
    On 10/2/2026 11:24 AM, dart200 wrote:
    On 10/2/26 3:19 AM, Chris M. Thomasson wrote:
    On 10/1/2026 8:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? If so, >>>>>>> so what?

    it is solvable for an enumerable set of machines that includes all >>>>>> possible output sequences, it is not solvable for all possible
    machines


    Well, we know a program A can decide for a program B. But there
    exists infinity many programs that cannot decide for B.

    which is fine because those infinitely many machines do not contain
    a sequence outside the enumeration i proved effectively decidable

    there is no practical need to utilize infinite languages to compute
    things dud, we only actually need _one_ turing complete language to
    do it ... and we can form one which is both effectively decidable
    and includes all possible output sequence!

    which my god is such a refreshing to prove, we really do utilize far
    to many programming languages for no good reason tbh


    Interesting...

    unfortunately i have since proven the proof incorrect

    The claim you are referring to is entirely false and fabricated,
    originating from a mashup of internet rumors and memes made up by
    informants which have all been refuted and found to be spurious,
    crude, racist and biased - on this very board!

    Call me skeptical

    nah dud ur really just fking senile
    --
    hi, i'm nick!
    let's end war EfOa

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Dude@punditster@gmail.com to comp.theory,sci.logic,sci.math,alt.buddha.short.fat.guy,alt.messianic on Wed Nov 11 08:33:56 2026
    From Newsgroup: comp.theory

    On 11/10/2026 10:50 PM, dart200 wrote:
    On 11/10/26 9:33 AM, Dude wrote:
    On 11/9/2026 10:04 PM, dart200 wrote:
    On 11/9/26 6:33 PM, Chris M. Thomasson wrote:
    On 10/2/2026 11:24 AM, dart200 wrote:
    On 10/2/26 3:19 AM, Chris M. Thomasson wrote:
    On 10/1/2026 8:05 PM, dart200 wrote:
    On 10/1/26 5:28 PM, Chris M. Thomasson wrote:
    On 10/1/2026 3:54 PM, dart200 wrote:
    [...]

    Are you saying that the halting problem is not solvable? If so, >>>>>>>> so what?

    it is solvable for an enumerable set of machines that includes
    all possible output sequences, it is not solvable for all
    possible machines


    Well, we know a program A can decide for a program B. But there
    exists infinity many programs that cannot decide for B.

    which is fine because those infinitely many machines do not contain >>>>> a sequence outside the enumeration i proved effectively decidable

    there is no practical need to utilize infinite languages to compute >>>>> things dud, we only actually need _one_ turing complete language to >>>>> do it ... and we can form one which is both effectively decidable
    and includes all possible output sequence!

    which my god is such a refreshing to prove, we really do utilize
    far to many programming languages for no good reason tbh


    Interesting...

    unfortunately i have since proven the proof incorrect

    The claim you are referring to is entirely false and fabricated,
    originating from a mashup of internet rumors and memes made up by
    informants which have all been refuted and found to be spurious,
    crude, racist and biased - on this very board!

    Call me skeptical

    nah dud ur really just fking senile

    You can be anything posting anonymously on the internet. You choose to
    be a clown to be made fun of. Go figure.
    --- Synchronet 3.22a-Linux NewsLink 1.2