Liste des Groupes | Revenir à theory |
On 4/30/25 6:09 PM, olcott wrote:Computable functions are the basic objects of study inOn 4/30/2025 2:55 PM, dbush wrote:And there is no requirement that a Turing Machine, or a Function, actually use its input.On 4/30/2025 1:32 PM, olcott wrote:>On 4/30/2025 11:11 AM, Richard Heathfield wrote:>On 30/04/2025 16:44, joes wrote:>Am Wed, 30 Apr 2025 10:09:45 -0500 schrieb olcott:>On 4/29/2025 5:01 AM, Mikko wrote:>Yes it is, for all inputs.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; }
Not much of a computation, though, is it?
>
It IS NOT a Turing Computable function
Lying by misuse of terms.
>
A turing computable function is a mapping for which an algorithm exists to compute it, not the algorithm itself.
>
Further use of "turing computable function" when what is meant is "algorithm" will result in the former being replaced with the later in future responses to your posts to make it clear what you are actually talking about.
>
>because it does not ever apply any finite>
string transformation rules to its inputs.
Sure it does. It computes the mapping of all pairs of integers to the number 5.
>
int sum(int x, int y) { return 5; }
Does not apply transformations to its inputs
to derive its outputs thus is no kind of computable
function not even for sum(2,3).
>
Note sum(2,3) isn't a Function, it is an invocation of a Function.--
You seem to have a lot of misunderstanding about the meaning of the words you use.
Les messages affichés proviennent d'usenet.