On 1/16/26 8:46 AM, Richard Damon wrote:
On 1/16/26 4:08 AM, dart200 wrote:
On 1/15/26 7:28 PM, Richard Damon wrote:
On 1/15/26 7:23 AM, dart200 wrote:
bro stick a giant dildo up ur asshole u hypocritical fuckface...
when i tried to suggest improvements to the computational model,
like RTMs, u then told me i *can't* do that because muh ct-thesis,
and here u are crying about how no superior method has been found
as if u'd ever even tried to look past the ct-thesis...
No, you didn't suggest improvements to the model, you just showed
you don't knoww what that means.
You don't get to change what a "computation" is, that isn't part of
the "model".
you honestly could have just said that cause the rest of this is just
u repeating urself as if that makes it more correct
But I HAVE said it that simply, and you rejected it as you think you
get to,
but repeating urself doesn't make it more true
The model would be the format of the machine, and while your RTM
might be a type of machine that could be thought of, they don't do
COMPUTATIONS, as it violates the basic rules of what a compuation IS.
Computations are specific algorithms acting on just the input data.
A fundamental property needed to reach at least Turing Complete
ability, is the ability to cascade algorithms.
Your RTM break that capability, and thus become less than Turing
Complete.
i'm sorry, RTMs are literally just TMs with one added instruction
that dumps static meta-data + copies tape ... how have they *lost*
power with that??? clearly they can express anything that TMs can ...
Which means you don't understand how "TM"s work, as they don't have
that sort of "instructions".
fuck dude sorry "operation" is the term turing used, i added to the list
of possible operations with RTMs, my god dude...
see how fucking unhelpful u are???
And, any algorithm that actually USES their capability to detect if
they have been nested will become incorrect as a decider, as a
decider is a machine that computes a specific mapping of its input
to its output, and if that result changes in the submachine, only
one of the answers it gives (as a stand-alone, or as the sub-
machine) can be right, so you just show that it gave a wrong answer.
u have proof that doesn't work yet you keep asserting this is the
"one true way". seems like u just enjoy shooting urself in the foot,
with the only actual rational way being it's just the "one true way"
IT IS DEFINITION. Something you don't seem to understand.
"Computation" is NOT defined by what some machine does, that is
algorithms and results. "Computation" is the mapping generated by it,
which MUST be a specific mapping of input to output.
no one has defined "computation" well enough to prove that turing
machines can compute them all,
On 1/16/2026 4:21 PM, dart200 wrote:
On 1/16/26 8:46 AM, Richard Damon wrote:
On 1/16/26 4:08 AM, dart200 wrote:
On 1/15/26 7:28 PM, Richard Damon wrote:
On 1/15/26 7:23 AM, dart200 wrote:
bro stick a giant dildo up ur asshole u hypocritical fuckface...
when i tried to suggest improvements to the computational model,
like RTMs, u then told me i *can't* do that because muh ct-thesis, >>>>>> and here u are crying about how no superior method has been found >>>>>> as if u'd ever even tried to look past the ct-thesis...
No, you didn't suggest improvements to the model, you just showed
you don't knoww what that means.
You don't get to change what a "computation" is, that isn't part of >>>>> the "model".
you honestly could have just said that cause the rest of this is
just u repeating urself as if that makes it more correct
But I HAVE said it that simply, and you rejected it as you think you
get to,
but repeating urself doesn't make it more true
The model would be the format of the machine, and while your RTM
might be a type of machine that could be thought of, they don't do
COMPUTATIONS, as it violates the basic rules of what a compuation IS. >>>>>
Computations are specific algorithms acting on just the input data.
A fundamental property needed to reach at least Turing Complete
ability, is the ability to cascade algorithms.
Your RTM break that capability, and thus become less than Turing
Complete.
i'm sorry, RTMs are literally just TMs with one added instruction
that dumps static meta-data + copies tape ... how have they *lost*
power with that??? clearly they can express anything that TMs can ...
Which means you don't understand how "TM"s work, as they don't have
that sort of "instructions".
fuck dude sorry "operation" is the term turing used, i added to the
list of possible operations with RTMs, my god dude...
see how fucking unhelpful u are???
And, any algorithm that actually USES their capability to detect if >>>>> they have been nested will become incorrect as a decider, as a
decider is a machine that computes a specific mapping of its input
to its output, and if that result changes in the submachine, only
one of the answers it gives (as a stand-alone, or as the sub-
machine) can be right, so you just show that it gave a wrong answer.
u have proof that doesn't work yet you keep asserting this is the
"one true way". seems like u just enjoy shooting urself in the foot,
with the only actual rational way being it's just the "one true way"
IT IS DEFINITION. Something you don't seem to understand.
"Computation" is NOT defined by what some machine does, that is
algorithms and results. "Computation" is the mapping generated by it,
which MUST be a specific mapping of input to output.
no one has defined "computation" well enough to prove that turing
machines can compute them all,
*The essence of all Computation generically defined*
Computation only applies finite string
transformation rules to finite string inputs.
Computable functions are Computations that
always stop running.
The empty string counts as a string.
| Sysop: | datGSguy |
|---|---|
| Location: | Eugene, OR |
| Users: | 7 |
| Nodes: | 4 (0 / 4) |
| Uptime: | 219:25:20 |
| Calls: | 361 |
| Calls today: | 34 |
| Files: | 14 |
| D/L today: |
79 files (1,304K bytes) |
| Messages: | 5,781 |
| Posted today: | 1 |