On 9/30/2026 10:50 AM, Chris M. Thomasson wrote:
On 9/30/2026 9:36 AM, Dude wrote:This s good news!
On 9/30/2026 12:23 AM, Chris M. Thomasson wrote:
On 9/28/2026 9:47 PM, dart200 wrote:The main thing is that you halted the input of BASIC into a text
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:
[...]
Sigh. I only said you kind of do remind me of the way PO >>>>>>>>>>>>>> dealt with the halting program.If not, wtf! You remind me of PO. Sorry for that cut. >>>>>>>>>>>>>>>i don't care for ur fallacy by association brainrot >>>>>>>>>>>>>>
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. ;^)
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.
Now you can write your paper and self-publish for review on Usenet.
It fuzzes the program until all paths are hit. Once that occurs, it
halts.
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 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.
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
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...
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...
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
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:That's a given.
On 10/2/2026 1:38 PM, Chris M. Thomasson wrote:
On 10/1/2026 5:14 PM, Dude wrote:Why Peter Olcott is correct
On 10/1/2026 3:47 PM, Chris M. Thomasson wrote:
On 9/30/2026 8:00 PM, Dude wrote:It's even odder for someone to post here about Turing and the
On 9/28/2026 3:08 PM, Chris M. Thomasson wrote:
On 9/25/2026 11:28 AM, dart200 wrote:On 7/29/25 11:12 PM, olcott wrote:
[...]
You should read hours of PO nonsense as you are looking into a >>>>>>>>> mirror.
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.
halting problem, which has been discussed here for decades, and
never read any
Peter Olcott halting solutions.
Agreed.
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...
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 11/9/2026 10:04 PM, dart200 wrote:
On 11/9/26 6:33 PM, Chris M. Thomasson wrote:The claim you are referring to is entirely false and fabricated,
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
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
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:The claim you are referring to is entirely false and fabricated,
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
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
| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 76 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 58:38:31 |
| Calls: | 1,265 |
| Calls today: | 1 |
| Files: | 1,362 |
| D/L today: |
4 files (9,632K bytes) |
| Messages: | 285,989 |