Sujet : Re: Turing Machine computable functions apply finite string transformations to inputs
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theoryDate : 30. Apr 2025, 16:44:38
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <991dde3a60e1485815b789520c7149e7842d18f2@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Wed, 30 Apr 2025 10:09:45 -0500 schrieb olcott:
On 4/29/2025 5:01 AM, Mikko wrote:
Irrelevant. There is sufficient agreement what Turing machines are.
Turing machine computable functions must apply finite string
transformation rues to inputs to derive outputs.
This is not a function that computes the sum(3,2):
int sum(int x, int y) { return 5; }
Yes it is, for all inputs.
-- 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.
…