FW: question: who has proved ... ?
20 views
Skip to first unread message
Kreinovich, Vladik
Mar 27, 2018, 10:39:34 AM3/27/18
to constructivenews, klaus.w...@fernuni-hagen.de
FYI
-----Original Message-----
From: Klaus Weihrauch [mailto:klaus.w...@fernuni-hagen.de]
Sent: Tuesday, March 27, 2018 1:00 AM
Dear all,
who has proved the following theorem (for the first time)?
Let $\psi$ be a numbering of the set of partial recursive functions which satisfies the utm-theorem.
Theorem: $\psi$ satisfies the smn-theorem, iff $\psi$ allows effective composition.
Effective composition: there is a computable function $h$ such that $\psi_i\circ \psi_j = \psi_{h(i,j)}$.
Klaus Weihrauch
-----Original Message-----
From: Klaus Weihrauch [mailto:klaus.w...@fernuni-hagen.de]
Sent: Tuesday, March 27, 2018 1:00 AM
Dear all,
who has proved the following theorem (for the first time)?
Let $\psi$ be a numbering of the set of partial recursive functions which satisfies the utm-theorem.
Theorem: $\psi$ satisfies the smn-theorem, iff $\psi$ allows effective composition.
Effective composition: there is a computable function $h$ such that $\psi_i\circ \psi_j = \psi_{h(i,j)}$.
Klaus Weihrauch
Reply all
Reply to author
Forward
0 new messages