Groups | Search | Server Info | Login | Register
Groups > comp.software-eng > #3843
| From | olcott <polcott333@gmail.com> |
|---|---|
| Newsgroups | comp.theory, comp.ai.philosophy, comp.software-eng |
| Subject | The essence of all Computation generically defined |
| Date | 2026-01-16 18:35 -0600 |
| Organization | A noiseless patient Spider |
| Message-ID | <10kelfp$2505k$1@dont-email.me> (permalink) |
| References | (14 earlier) <10kam87$ofu9$1@dont-email.me> <4fiaR.134641$Ij5a.121807@fx15.iad> <10kcv63$18ne5$1@dont-email.me> <4YtaR.289653$ZkQ4.281544@fx47.iad> <10kedkg$21adq$1@dont-email.me> |
Cross-posted to 3 groups.
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,
>
Computation only applies finite string
transformation rules to finite string inputs.
Deciders transform finite string inputs by
finite string transformation rules into
{Accept, Reject} values.
--
Copyright 2026 Olcott<br><br>
My 28 year goal has been to make <br>
"true on the basis of meaning expressed in language"<br>
reliably computable.<br><br>
This required establishing a new foundation<br>
Back to comp.software-eng | Previous | Next — Previous in thread | Next in thread | Find similar
Re: Proof that the halting problem itself is a category error polcott <polcott333@gmail.com> - 2025-12-10 17:03 -0600
Re: Proof that the halting problem itself is a category error wij <wyniijj5@gmail.com> - 2025-12-11 07:10 +0800
Re: Proof that the halting problem itself is a category error --- typo polcott <polcott333@gmail.com> - 2025-12-10 17:53 -0600
Re: Proof that the halting problem itself is a category error Oleksiy Gapotchenko <alex.s.gap@gmail.com> - 2026-01-06 01:24 +0100
Re: Proof that the halting problem itself is a category error olcott <polcott333@gmail.com> - 2026-01-05 18:39 -0600
is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-05 23:47 -0800
Re: is the ct-thesis cooked? olcott <polcott333@gmail.com> - 2026-01-06 19:26 -0600
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-06 19:03 -0800
Re: is the ct-thesis cooked? olcott <polcott333@gmail.com> - 2026-01-06 22:33 -0600
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-07 00:56 -0800
yes/no questions lacking a correct yes/no answer are incorrect questions olcott <polcott333@gmail.com> - 2026-01-07 05:50 -0600
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-12 07:12 -0500
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-12 07:06 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-12 14:09 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-12 22:16 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-12 20:21 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-13 07:09 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-13 12:33 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-14 22:43 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-15 04:23 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-15 22:28 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-16 01:08 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-16 11:46 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-16 14:21 -0800
The essence of all Computation generically defined olcott <polcott333@gmail.com> - 2026-01-16 16:58 -0600
Re: The essence of all Computation generically defined Richard Damon <Richard@Damon-Family.org> - 2026-01-16 18:21 -0500
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-16 18:21 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-16 16:43 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-16 22:24 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-16 23:23 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-17 07:33 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-17 19:14 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-17 22:28 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-17 22:05 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-18 07:05 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-18 10:15 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-18 15:56 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-18 13:50 -0800
Re: is the ct-thesis cooked? Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-18 22:27 +0000
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-18 15:01 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-18 19:28 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-18 20:30 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-20 00:29 -0500
Re: is the ct-thesis cooked? Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-18 22:28 +0000
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-18 19:28 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-18 20:51 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-20 00:29 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-19 22:18 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-20 07:59 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-20 17:55 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-24 09:44 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-24 14:36 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-24 19:52 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-24 18:24 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-25 13:21 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-25 13:05 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-25 17:36 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-25 21:56 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-26 11:39 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-26 11:43 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-26 17:17 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-26 14:29 -0800
Re: is the ct-thesis cooked? Dude <punditster@gmail.com> - 2026-01-27 13:31 -0800
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-28 01:12 -0800
Re: is the ct-thesis cooked? Dude <punditster@gmail.com> - 2026-01-28 13:29 -0800
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-28 13:37 -0800
Re: is the ct-thesis cooked? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-01-27 14:07 -0800
Re: is the ct-thesis cooked? Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-28 07:23 -0500
Re: is the ct-thesis cooked? Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-17 12:17 +0000
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-17 08:15 -0500
Re: is the ct-thesis cooked? dart200 <user7160@newsgrouper.org.invalid> - 2026-01-17 09:47 -0800
Re: is the ct-thesis cooked? Richard Damon <Richard@Damon-Family.org> - 2026-01-17 15:31 -0500
The essence of all Computation generically defined olcott <polcott333@gmail.com> - 2026-01-16 18:35 -0600
Re: is the ct-thesis cooked? Mikko <mikko.levanto@iki.fi> - 2026-01-07 14:05 +0200
Exactly what are deciders in the theory of computation? olcott <polcott333@gmail.com> - 2026-01-07 15:29 -0600
Re: is the ct-thesis cooked? PLO olcott <polcott333@gmail.com> - 2026-01-24 17:06 -0600
Re: is the ct-thesis cooked? PLO Richard Damon <Richard@Damon-Family.org> - 2026-01-24 19:52 -0500
Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-24 18:05 -0800
Re: is the ct-thesis cooked? PLO Richard Damon <Richard@Damon-Family.org> - 2026-01-25 13:23 -0500
Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-25 13:04 -0800
Re: is the ct-thesis cooked? PLO Richard Damon <Richard@Damon-Family.org> - 2026-01-25 17:40 -0500
Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-25 22:50 -0800
Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-26 01:35 -0800
Re: is the ct-thesis cooked? PLO Richard Damon <Richard@Damon-Family.org> - 2026-01-26 11:43 -0500
Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-26 11:45 -0800
Re: is the ct-thesis cooked? PLO Richard Damon <Richard@Damon-Family.org> - 2026-01-26 17:28 -0500
Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-27 00:00 -0800
Re: is the ct-thesis cooked? PLO olcott <polcott333@gmail.com> - 2026-01-24 20:35 -0600
Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-24 18:38 -0800
Re: is the ct-thesis cooked? PLO olcott <polcott333@gmail.com> - 2026-01-24 20:53 -0600
Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-24 19:12 -0800
Re: is the ct-thesis cooked? PLO olcott <polcott333@gmail.com> - 2026-01-24 21:42 -0600
Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-24 20:03 -0800
Re: is the ct-thesis cooked? PLO olcott <polcott333@gmail.com> - 2026-01-24 22:06 -0600
Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-24 21:45 -0800
Re: Proof that the halting problem itself is a category error Mikko <mikko.levanto@iki.fi> - 2026-01-06 15:23 +0200
Boiling Gödel's 1931 Incompleteness proof down to its barest essence olcott <polcott333@gmail.com> - 2026-01-06 08:02 -0600
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence Mikko <mikko.levanto@iki.fi> - 2026-01-07 14:10 +0200
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence olcott <polcott333@gmail.com> - 2026-01-07 07:06 -0600
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence Mikko <mikko.levanto@iki.fi> - 2026-01-08 12:21 +0200
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence olcott <polcott333@gmail.com> - 2026-01-08 08:18 -0600
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence Mikko <mikko.levanto@iki.fi> - 2026-01-10 11:25 +0200
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence olcott <polcott333@gmail.com> - 2026-01-11 08:32 -0600
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-11 16:16 +0000
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence olcott <NoOne@NoWhere.com> - 2026-01-11 21:00 -0600
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence Mikko <mikko.levanto@iki.fi> - 2026-01-12 13:05 +0200
csiph-web