[PDF][PDF] Data representation and computational complexity
R Verbeek, K Weihrauch - Theoretical Computer Science, 1978 - core.ac.uk
R Verbeek, K Weihrauch
Theoretical Computer Science, 1978•core.ac.ukIn order to compute a function f: M+ A4 on a machine, the set M must necesssr. rily be
represented by the input/output set N of the mnchine. This presen-tation can be described by
a relation Y c N x M, where “xvy” mearlc:“. Y represents y” 9r “X is a name of y “. Examples
we have in mind are the representation of partial recursive functions, finite graphs, rational
numbers, regular languages, constructive ordinals (or even words or nu, mbers) by numbers
or words. The most natural way to define computability via c'is as follows. The function f …
represented by the input/output set N of the mnchine. This presen-tation can be described by
a relation Y c N x M, where “xvy” mearlc:“. Y represents y” 9r “X is a name of y “. Examples
we have in mind are the representation of partial recursive functions, finite graphs, rational
numbers, regular languages, constructive ordinals (or even words or nu, mbers) by numbers
or words. The most natural way to define computability via c'is as follows. The function f …
In order to compute a function f: M+ A4 on a machine, the set M must necesssr. rily be represented by the input/output set N of the mnchine. This presen-tation can be described by a relation Y c N x M, where “xvy” mearlc:“. Y represents y” 9r “X is a name of y “.
Examples we have in mind are the representation of partial recursive functions, finite graphs, rational numbers, regular languages, constructive ordinals (or even words or nu, mbers) by numbers or words. The most natural way to define computability via c’is as follows. The function f: M+;“M is “iv-computed” by g: N+ N, iff
core.ac.uk
Showing the best result for this search. See all results