Re: Turing computable functions

Liste des GroupesRevenir à c theory 
Sujet : Re: Turing computable functions
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theory
Date : 25. Mar 2025, 22:12:26
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <78d32d510fd3378233ebc9e50676e3b964131cac@i2pn2.org>
References : 1 2 3 4 5
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Tue, 25 Mar 2025 15:50:33 -0500 schrieb olcott:
On 3/25/2025 3:05 PM, dbush wrote:
On 3/25/2025 3:47 PM, olcott wrote:
On 3/25/2025 2:32 PM, dbush wrote:
On 3/25/2025 3:24 PM, olcott wrote:

Cannot possibly derive any outputs not computed from their inputs.
Correct, algorithms can only compute computable mathematical
function.
>
A Turing machine halt decider
Does not exist because the required mapping is not computable:
Given any algorithm (i.e. a fixed immutable sequence of instructions)
X described as <X> with input Y:
A solution to the halting problem is an algorithm H that computes the
following mapping:
(<X>,Y) maps to 1 if and only if X(Y) halts when executed directly
(<X>,Y) maps to 0 if and only if X(Y) does not halt when executed
directly
>
cannot possibly report on the behavior of any directly executing
process. No Turing machine can every do this. This has always been
beyond what any Turing machine can ever do.
Strawman: reporting on an executing process is not a requirement.
YOU JUST SAID THAT IT WAS YOU KEEP MINDLESSLY REPEATING THAT IT IS
I never said it had to actually watch an executing process, only report
what would happen if it did run.
*It has been conclusively proven as a verified*
*fact many hundreds of times over several years*
That the behavior that the finite string input specifies is not perfect
proxy for the behavior of the underlying directly executed machine.
A TM can be completely specified in a finite string.

--
Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
It is not guaranteed that n+1 exists for every n.

Date Sujet#  Auteur
25 Mar 25 * Turing computable functions39olcott
25 Mar 25 +* Re: Turing computable functions13dbush
25 Mar 25 i`* Re: Turing computable functions12olcott
25 Mar 25 i +* Re: Turing computable functions10dbush
25 Mar 25 i i`* Re: Turing computable functions9olcott
25 Mar 25 i i +* Re: Turing computable functions4dbush
25 Mar 25 i i i`* Re: Turing computable functions3olcott
25 Mar 25 i i i +- Re: Turing computable functions1Richard Damon
26 Mar 25 i i i `- Re: Turing computable functions1joes
25 Mar 25 i i +* Re: Turing computable functions3joes
25 Mar 25 i i i`* Re: Turing computable functions2olcott
25 Mar 25 i i i `- Re: Turing computable functions1Richard Damon
25 Mar 25 i i `- Re: Turing computable functions1Richard Damon
25 Mar 25 i `- Re: Turing computable functions1Richard Damon
25 Mar 25 +* Re: Turing computable functions11joes
25 Mar 25 i`* Re: Turing computable functions --- EEE(III)10olcott
25 Mar 25 i +* Re: Turing computable functions --- EEE(III)8Richard Damon
26 Mar 25 i i`* Re: Turing computable functions --- EEE(III)7olcott
26 Mar 25 i i +* Re: Turing computable functions --- EEE(III)3joes
26 Mar 25 i i i`* Re: Turing computable functions --- EEE(III)2olcott
27 Mar 25 i i i `- Re: Turing computable functions --- EEE(III)1Richard Damon
26 Mar 25 i i `* Re: Turing computable functions --- EEE(III)3Richard Damon
26 Mar 25 i i  `* Re: Turing computable functions --- EEE(III)2olcott
27 Mar 25 i i   `- Re: Turing computable functions --- EEE(III)1Richard Damon
26 Mar 25 i `- Re: Turing computable functions --- EEE(III)1Fred. Zwarts
25 Mar 25 +- Re: Turing computable functions1Richard Damon
26 Mar 25 +* Re: Turing computable functions12Mikko
26 Mar 25 i`* Re: Turing computable functions11olcott
27 Mar 25 i +- Re: Turing computable functions1Richard Damon
27 Mar 25 i +* Re: Turing computable functions3Mikko
27 Mar 25 i i`* Re: Turing computable functions2olcott
28 Mar 25 i i `- Re: Turing computable functions1Mikko
27 Mar 25 i `* Re: Turing computable functions6Fred. Zwarts
27 Mar 25 i  `* Re: Turing computable functions5olcott
27 Mar 25 i   +* Re: Turing computable functions3Fred. Zwarts
28 Mar 25 i   i`* Re: Turing computable functions2olcott
28 Mar 25 i   i `- Re: Turing computable functions1Richard Damon
28 Mar 25 i   `- Re: Turing computable functions1Richard Damon
26 Mar 25 `- Re: Turing computable functions1Fred. Zwarts

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal