On 31/08/2026 04:22, Johann 'Myrkraverk' Oskarsson wrote:
On 28/08/2026 3:21 PM, Mikko wrote:
On 27/08/2026 14:46, Johann 'Myrkraverk' Oskarsson wrote:
On 27/08/2026 3:49 PM, Mikko wrote:
On 27/08/2026 08:40, dart200 wrote:
title of my next paper is tentative, but i'm kinda liking it. yes >>>>>> i'm quite serious about refuting the church turing thesis. i
demonstrate how an idealized human agent can compute that which is >>>>>> not turing computable.
Is there any way to prove that humans can compute anyhing not Turing >>>>> computable? Much can be computed with a Turing computable partial
method.
I previously gave this practical counter example, and you're welcome
to prove me wrong.
You pick up an Antikythera mechanism, and use it to compute something, >>>> anything.
Unlikely, as the mechanism is not fylly known. Only one damaged example
is known and there is no evicence that more was ever constructed.
Dear Mikko,
I'm afraid you're wading in error and confusion.-a Please stop breathing
those sauna fumes in Finland, and do your original research.-a Here is
mine.
-a-a https://www.antikytheramechanism.co.uk/category/all-products
So, 1) the mechanism is fully known, 2) and there have been reconstruct-
ions since.-a Now, if you want to /define/ a reconstruction as an invalid
method of arguing on Usenet, I'll just have to tip my top hat to you,
and insist you invent a time machine instead.
The reconstruction is reasonble but it is impossible to verify every
detail. But the mechanism is understood sufficiently well that the
the purpose and idea can be understood. That a part of the writing on
the machine has been read also helps.
The remaining uncertainties are small and irrelevant to our discussion.
Now, after that feat, how do you do this with a Turing machine?Turing> machine, but you cannot /compute/ as one.
-aYou can obviously simulate the Antikythera mechanism with a
Simulation is enough. If one can simulate a machine one can compute
what the simulated machine can compute.
Let there be epsilon less than delta.-a Once you have constructed a simu-
lation, I'll construct a level, and a fine bolt to adjust it.-a I believe
I'll try for twenty thousand threads per inch.-a So the question is, can
I nudge an arbitrary long lever, with a bolt -- hopefully starting at
twenty thousand threads per inch -- finely enough, that each nudge fits
within the smallest floating point precision you have -- I'm going to
assume you were going to use double precision in C, REAL*8 in Fortran 77
or f64 in Rust -- and you won't /see it/ because your simulation lacks
real world precision?
The topic was Turing computability. Particuar floating point limitations
are irrelevant. Computability of real numbers means computability to any desired precision.
On 31/08/2026 5:36 PM, Mikko wrote:
On 31/08/2026 04:22, Johann 'Myrkraverk' Oskarsson wrote:
On 28/08/2026 3:21 PM, Mikko wrote:
On 27/08/2026 14:46, Johann 'Myrkraverk' Oskarsson wrote:
On 27/08/2026 3:49 PM, Mikko wrote:
On 27/08/2026 08:40, dart200 wrote:
title of my next paper is tentative, but i'm kinda liking it. yes >>>>>>> i'm quite serious about refuting the church turing thesis. i
demonstrate how an idealized human agent can compute that which
is not turing computable.
Is there any way to prove that humans can compute anyhing not Turing >>>>>> computable? Much can be computed with a Turing computable partial
method.
I previously gave this practical counter example, and you're welcome >>>>> to prove me wrong.
You pick up an Antikythera mechanism, and use it to compute something, >>>>> anything.
Unlikely, as the mechanism is not fylly known. Only one damaged example >>>> is known and there is no evicence that more was ever constructed.
Dear Mikko,
I'm afraid you're wading in error and confusion. Please stop breathing
those sauna fumes in Finland, and do your original research. Here is
mine.
https://www.antikytheramechanism.co.uk/category/all-products
So, 1) the mechanism is fully known, 2) and there have been reconstruct- >>> ions since. Now, if you want to /define/ a reconstruction as an invalid >>> method of arguing on Usenet, I'll just have to tip my top hat to you,
and insist you invent a time machine instead.
The reconstruction is reasonble but it is impossible to verify every
detail. But the mechanism is understood sufficiently well that the
the purpose and idea can be understood. That a part of the writing on
the machine has been read also helps.
The remaining uncertainties are small and irrelevant to our discussion.
Now, after that feat, how do you do this with a Turing machine?Turing> machine, but you cannot /compute/ as one.
You can obviously simulate the Antikythera mechanism with a
Simulation is enough. If one can simulate a machine one can compute
what the simulated machine can compute.
Let there be epsilon less than delta. Once you have constructed a simu- >>> lation, I'll construct a level, and a fine bolt to adjust it. I believe >>> I'll try for twenty thousand threads per inch. So the question is, can
I nudge an arbitrary long lever, with a bolt -- hopefully starting at
twenty thousand threads per inch -- finely enough, that each nudge fits
within the smallest floating point precision you have -- I'm going to
assume you were going to use double precision in C, REAL*8 in Fortran 77 >>> or f64 in Rust -- and you won't /see it/ because your simulation lacks
real world precision?
The topic was Turing computability. Particuar floating point limitations
are irrelevant. Computability of real numbers means computability to any
desired precision.
Right, so you want to stick to that argument? Can you construct arbi-
trary precision floating point library, and can I still create an arbi-
trary long lever, with an arbitrary fine threaded bolt to push it, so
that when you try to allocate more R.A.M. for the results, you panic
because your tower of computation runs out of memory and forgets every- thing?
I'm assuming you're going to write your simulator in Rust, being a duly anointed philosopher of a doctorate, I have no idea which, so I've added comp.lang.misc to this discussion, as comp.lang.rust is still being de-
bated in news.groups.proposals.
I will now await for you to finish said simulator, before I begin con- structing my very own mechanical shop of machinery, and /define/ myself
as having won said argument until you show an actual working simulator
I can then crash with a panic!
Enjoy making the simulator in Rust!
On 08/31/2026 04:23 AM, Johann 'Myrkraverk' Oskarsson wrote:
On 31/08/2026 5:36 PM, Mikko wrote:
On 31/08/2026 04:22, Johann 'Myrkraverk' Oskarsson wrote:
On 28/08/2026 3:21 PM, Mikko wrote:
On 27/08/2026 14:46, Johann 'Myrkraverk' Oskarsson wrote:
On 27/08/2026 3:49 PM, Mikko wrote:
On 27/08/2026 08:40, dart200 wrote:
title of my next paper is tentative, but i'm kinda liking it. yes >>>>>>>> i'm quite serious about refuting the church turing thesis. i
demonstrate how an idealized human agent can compute that which >>>>>>>> is not turing computable.
Is there any way to prove that humans can compute anyhing not Turing >>>>>>> computable? Much can be computed with a Turing computable partial >>>>>>> method.
I previously gave this practical counter example, and you're welcome >>>>>> to prove me wrong.
You pick up an Antikythera mechanism, and use it to compute
something,
anything.
Unlikely, as the mechanism is not fylly known. Only one damaged
example
is known and there is no evicence that more was ever constructed.
Dear Mikko,
I'm afraid you're wading in error and confusion.-a Please stop breathing >>>> those sauna fumes in Finland, and do your original research.-a Here is >>>> mine.
-a-a https://www.antikytheramechanism.co.uk/category/all-products
So, 1) the mechanism is fully known, 2) and there have been
reconstruct-
ions since.-a Now, if you want to /define/ a reconstruction as an
invalid
method of arguing on Usenet, I'll just have to tip my top hat to you,
and insist you invent a time machine instead.
The reconstruction is reasonble but it is impossible to verify every
detail. But the mechanism is understood sufficiently well that the
the purpose and idea can be understood. That a part of the writing on
the machine has been read also helps.
The remaining uncertainties are small and irrelevant to our discussion.
Now, after that feat, how do you do this with a Turing machine?Turing> machine, but you cannot /compute/ as one.
You can obviously simulate the Antikythera mechanism with a
Simulation is enough. If one can simulate a machine one can compute
what the simulated machine can compute.
Let there be epsilon less than delta.-a Once you have constructed a
simu-
lation, I'll construct a level, and a fine bolt to adjust it.-a I
believe
I'll try for twenty thousand threads per inch.-a So the question is, can >>>> I nudge an arbitrary long lever, with a bolt -- hopefully starting at
twenty thousand threads per inch -- finely enough, that each nudge fits >>>> within the smallest floating point precision you have -- I'm going to
assume you were going to use double precision in C, REAL*8 in
Fortran 77
or f64 in Rust -- and you won't /see it/ because your simulation lacks >>>> real world precision?
The topic was Turing computability. Particuar floating point limitations >>> are irrelevant. Computability of real numbers means computability to any >>> desired precision.
Right, so you want to stick to that argument?-a Can you construct arbi-
trary precision floating point library, and can I still create an arbi-
trary long lever, with an arbitrary fine threaded bolt to push it, so
that when you try to allocate more R.A.M. for the results, you panic
because your tower of computation runs out of memory and forgets every-
thing?
I'm assuming you're going to write your simulator in Rust, being a duly
anointed philosopher of a doctorate, I have no idea which, so I've added
comp.lang.misc to this discussion, as comp.lang.rust is still being de-
bated in news.groups.proposals.
I will now await for you to finish said simulator, before I begin con-
structing my very own mechanical shop of machinery, and /define/ myself
as having won said argument until you show an actual working simulator
I can then crash with a panic!
Enjoy making the simulator in Rust!
"Interval arithmetic" is a usual sort of principled account
with regards to "extended-precision arithmetic" that though
mostly the "computer algebra systems" keep things formulaic
throughout and only approximate numbers at the end.
It's like when computing rotations in computer graphics,
and there's a great account that matrix-manipulation the
matrix-manipulation starts to have that 90-degree rotations
start looking slightly off, i.e., it's relevant to getting
things straight left-to-right and up-to-down, or according
to the various coordinate and sign conventions or representations
on a grid of picture-elements, that for simple accounts like
vertical and horizontal lines on paper that making floating-point
is graphically unsettling.
On 31/08/2026 10:33 PM, Ross Finlayson wrote:
On 08/31/2026 04:23 AM, Johann 'Myrkraverk' Oskarsson wrote:
On 31/08/2026 5:36 PM, Mikko wrote:
On 31/08/2026 04:22, Johann 'Myrkraverk' Oskarsson wrote:
On 28/08/2026 3:21 PM, Mikko wrote:
On 27/08/2026 14:46, Johann 'Myrkraverk' Oskarsson wrote:
On 27/08/2026 3:49 PM, Mikko wrote:
On 27/08/2026 08:40, dart200 wrote:
title of my next paper is tentative, but i'm kinda liking it. yes >>>>>>>>> i'm quite serious about refuting the church turing thesis. i >>>>>>>>> demonstrate how an idealized human agent can compute that which >>>>>>>>> is not turing computable.
Is there any way to prove that humans can compute anyhing not
Turing
computable? Much can be computed with a Turing computable partial >>>>>>>> method.
I previously gave this practical counter example, and you're welcome >>>>>>> to prove me wrong.
You pick up an Antikythera mechanism, and use it to compute
something,
anything.
Unlikely, as the mechanism is not fylly known. Only one damaged
example
is known and there is no evicence that more was ever constructed.
Dear Mikko,
I'm afraid you're wading in error and confusion. Please stop
breathing
those sauna fumes in Finland, and do your original research. Here is >>>>> mine.
https://www.antikytheramechanism.co.uk/category/all-products
So, 1) the mechanism is fully known, 2) and there have been
reconstruct-
ions since. Now, if you want to /define/ a reconstruction as an
invalid
method of arguing on Usenet, I'll just have to tip my top hat to you, >>>>> and insist you invent a time machine instead.
The reconstruction is reasonble but it is impossible to verify every
detail. But the mechanism is understood sufficiently well that the
the purpose and idea can be understood. That a part of the writing on
the machine has been read also helps.
The remaining uncertainties are small and irrelevant to our discussion. >>>>
Now, after that feat, how do you do this with a Turing machine? >>>>>> > You can obviously simulate the Antikythera mechanism with aTuring> machine, but you cannot /compute/ as one.
Simulation is enough. If one can simulate a machine one can compute >>>>>> what the simulated machine can compute.
Let there be epsilon less than delta. Once you have constructed a
simu-
lation, I'll construct a level, and a fine bolt to adjust it. I
believe
I'll try for twenty thousand threads per inch. So the question is,
can
I nudge an arbitrary long lever, with a bolt -- hopefully starting at >>>>> twenty thousand threads per inch -- finely enough, that each nudge
fits
within the smallest floating point precision you have -- I'm going to >>>>> assume you were going to use double precision in C, REAL*8 in
Fortran 77
or f64 in Rust -- and you won't /see it/ because your simulation lacks >>>>> real world precision?
The topic was Turing computability. Particuar floating point
limitations
are irrelevant. Computability of real numbers means computability to
any
desired precision.
Right, so you want to stick to that argument? Can you construct arbi-
trary precision floating point library, and can I still create an arbi-
trary long lever, with an arbitrary fine threaded bolt to push it, so
that when you try to allocate more R.A.M. for the results, you panic
because your tower of computation runs out of memory and forgets every-
thing?
I'm assuming you're going to write your simulator in Rust, being a duly
anointed philosopher of a doctorate, I have no idea which, so I've added >>> comp.lang.misc to this discussion, as comp.lang.rust is still being de-
bated in news.groups.proposals.
I will now await for you to finish said simulator, before I begin con-
structing my very own mechanical shop of machinery, and /define/ myself
as having won said argument until you show an actual working simulator
I can then crash with a panic!
Enjoy making the simulator in Rust!
"Interval arithmetic" is a usual sort of principled account
with regards to "extended-precision arithmetic" that though
mostly the "computer algebra systems" keep things formulaic
throughout and only approximate numbers at the end.
Do you mean to say that an /Antikythera mechanical simulator/
can be done purely in algebraic terms, and does not need float-
ing point at all?
Wouldn't that simulator just run out of R.A.M. faster than arbi-
trary precision floating point library?
It's like when computing rotations in computer graphics,
and there's a great account that matrix-manipulation the
matrix-manipulation starts to have that 90-degree rotations
start looking slightly off, i.e., it's relevant to getting
things straight left-to-right and up-to-down, or according
to the various coordinate and sign conventions or representations
on a grid of picture-elements, that for simple accounts like
vertical and horizontal lines on paper that making floating-point
is graphically unsettling.
I thought this was already solved in the 90s -- or earlier? -- by
using quaternions instead of matrices for the rotations, and that
it would remove the weird wobbling that comes from repeated calcu-
lations of the rotation matrix?
Please enlighten us on this subject!
| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 76 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 55:27:46 |
| Calls: | 1,265 |
| Calls today: | 1 |
| Files: | 1,362 |
| D/L today: |
3 files (2,684K bytes) |
| Messages: | 285,684 |