On 10/31/2026 3:37 AM, Mikko wrote:
On 30/10/2026 16:25, olcott wrote:
On 10/30/2026 4:23 AM, Mikko wrote:
On 29/10/2026 14:03, olcott wrote:
On 10/29/2026 4:04 AM, Mikko wrote:
On 26/10/2026 16:15, olcott wrote:
On 10/26/2026 4:23 AM, Mikko wrote:
It does not make sense to correct an error before an error is >>>>>>>> identified
and analyzed.
On 23/10/2026 21:10, olcott wrote:
These terms are replaced:
(a) "Turing machine description" is replaced with
-a-a-a-a [Finite string source code for a Turing Machine]
That does not make sense without a definition on "source code" >>>>>>>> in the
context of Turing machines. A description can be required to
have the
form that can be used for a particular purpose but the term "source >>>>>>>> code" does not unless so defined earlier in the same opus.
The term "Turing machine description" was vague because at the
tome the term computation source code dis not exist and the
TM description language had not be defined.
There was nothing vague in Turing's original description of the
"machine". The description language was as well defined as was
needed.
Source language is anyone of the languages anuone has ever used as >>>>>> for specifying a new Turing machine. A language used for writing
an existing description in a more suitable way is not a source
language.
If you specify that your decider is given the "source code" of a
Turing machine your decider must be able to interprete every
source code as intended by its original author ever in cases
where two authors give different meanings to the same strings.
The bottom line is that:
(a) My version written in C is equivalent to the TM versions
Do you mean the TM deciders that don't exist?
I mean that when all of the key details of the TM
proofs that have been abstracted are made concrete
and can be directly seen then prior misconceptions
are corrected.
Then you should reconsider your choice of words. Nobody understands
your words above that way.
Everyone "understands" my words as "Olcott is wrong
no need to pay attention"
On 31/10/2026 14:30, olcott wrote:
On 10/31/2026 3:37 AM, Mikko wrote:
On 30/10/2026 16:25, olcott wrote:
On 10/30/2026 4:23 AM, Mikko wrote:
On 29/10/2026 14:03, olcott wrote:
On 10/29/2026 4:04 AM, Mikko wrote:
On 26/10/2026 16:15, olcott wrote:
On 10/26/2026 4:23 AM, Mikko wrote:
It does not make sense to correct an error before an error is >>>>>>>>> identified
and analyzed.
On 23/10/2026 21:10, olcott wrote:
These terms are replaced:
(a) "Turing machine description" is replaced with
-a-a-a-a [Finite string source code for a Turing Machine]
That does not make sense without a definition on "source code" >>>>>>>>> in the
context of Turing machines. A description can be required to >>>>>>>>> have the
form that can be used for a particular purpose but the term >>>>>>>>> "source
code" does not unless so defined earlier in the same opus.
The term "Turing machine description" was vague because at the >>>>>>>> tome the term computation source code dis not exist and the
TM description language had not be defined.
There was nothing vague in Turing's original description of the
"machine". The description language was as well defined as was
needed.
Source language is anyone of the languages anuone has ever used as >>>>>>> for specifying a new Turing machine. A language used for writing >>>>>>> an existing description in a more suitable way is not a source
language.
If you specify that your decider is given the "source code" of a >>>>>>> Turing machine your decider must be able to interprete every
source code as intended by its original author ever in cases
where two authors give different meanings to the same strings.
The bottom line is that:
(a) My version written in C is equivalent to the TM versions
Do you mean the TM deciders that don't exist?
I mean that when all of the key details of the TM
proofs that have been abstracted are made concrete
and can be directly seen then prior misconceptions
are corrected.
Then you should reconsider your choice of words. Nobody understands
your words above that way.
Everyone "understands" my words as "Olcott is wrong
no need to pay attention"
Roughly so. If you want a different understanding you need different
words.
On 11/6/2026 2:26 AM, Mikko wrote:
On 31/10/2026 14:30, olcott wrote:
On 10/31/2026 3:37 AM, Mikko wrote:
On 30/10/2026 16:25, olcott wrote:
On 10/30/2026 4:23 AM, Mikko wrote:
On 29/10/2026 14:03, olcott wrote:
On 10/29/2026 4:04 AM, Mikko wrote:
On 26/10/2026 16:15, olcott wrote:
On 10/26/2026 4:23 AM, Mikko wrote:
It does not make sense to correct an error before an error is >>>>>>>>>> identified
and analyzed.
On 23/10/2026 21:10, olcott wrote:
These terms are replaced:That does not make sense without a definition on "source code" >>>>>>>>>> in the
(a) "Turing machine description" is replaced with
-a-a-a-a [Finite string source code for a Turing Machine] >>>>>>>>>>
context of Turing machines. A description can be required to >>>>>>>>>> have the
form that can be used for a particular purpose but the term >>>>>>>>>> "source
code" does not unless so defined earlier in the same opus.
The term "Turing machine description" was vague because at the >>>>>>>>> tome the term computation source code dis not exist and the
TM description language had not be defined.
There was nothing vague in Turing's original description of the >>>>>>>> "machine". The description language was as well defined as was >>>>>>>> needed.
Source language is anyone of the languages anuone has ever used as >>>>>>>> for specifying a new Turing machine. A language used for writing >>>>>>>> an existing description in a more suitable way is not a source >>>>>>>> language.
If you specify that your decider is given the "source code" of a >>>>>>>> Turing machine your decider must be able to interprete every
source code as intended by its original author ever in cases
where two authors give different meanings to the same strings.
The bottom line is that:
(a) My version written in C is equivalent to the TM versions
Do you mean the TM deciders that don't exist?
I mean that when all of the key details of the TM
proofs that have been abstracted are made concrete
and can be directly seen then prior misconceptions
are corrected.
Then you should reconsider your choice of words. Nobody understands
your words above that way.
Everyone "understands" my words as "Olcott is wrong
no need to pay attention"
Roughly so. If you want a different understanding you need different
words.
Computation defined
Paraphrase of Emil Post definition of computation
All computations are equivalent applying finite string
transformation rules to finite string inputs to derive
any and all outputs.
Because Post canonical systems are Turing-equivalent,
anything that cannot be derived by applying finite string
transformations to finite strings is outside of the domain
of ChurchrCoTuring computable functions.
| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 76 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 56:09:26 |
| Calls: | 1,265 |
| Calls today: | 1 |
| Files: | 1,362 |
| D/L today: |
3 files (2,684K bytes) |
| Messages: | 285,718 |