Myhill Isomorphism Theorem

In computability theory the Myhill isomorphism theorem, named after John Myhill, provides a characterization for two numberings to induce the same notion of computability on a set. It is reminiscent of the Schröder–Bernstein theorem in set theory and has been called a constructive version of it.

Theorem

A many-one reduction from a set $A \subseteq \mathbb$ to a set $B \subseteq \mathbb$ is a total computable function $f : \mathbb \to \mathbb$ such that $\forall x \in \mathbb, x \in A \iff f(x) \in B$. A one-one reduction is an injective reduction, and a computable isomorphism is a bijective reduction.

Myhill's isomorphism theorem: Two sets $A, B \subseteq \mathbb$ are computably isomorphic if and only if ''A'' is one-one-reducible to ''B'' and ''B'' is one-one-reducible to ''A''.

As a corollary, two total numberings are one-equivalent if and only if they are recursively isomorphic.

Myhill–Shepherdson theorem

The Myhill–Shepherdson theorem, stemming from the Rice–Shapiro theorem, defines the computable type 2 functionals. These functionals operate on computable partial functions, yielding numbers as results in cases of termination. Notably, they adhere to a specific effectiveness criterion and exhibit continuity as functionals.

Considering the notion of the Myhill isomorphism, which states there exists a total computable bijection, which maps elements reducible to each other in both directions, given the functions are extensional, this one specifies the definition for recursive functionals.

Specifically, it states:

# Let $\phi: \mathbb(\mathbb^k)$ $\rightarrow \mathbb(\mathbb^i)$ be a recursive function. Then, there exists a total computable function $h_\Phi: \mathbb \rightarrow \mathbb$ such that $\forall e \in \mathbb (\phi_e^k) = \phi_^$
# Let $h: \mathbb \rightarrow \mathbb$ be a total computable function and $h$ extensional. Then, there is a unique recursive functional $\phi: \mathbb(\mathbb^k)$ $\rightarrow \mathbb(\mathbb^i)$ such that $\forall e \in \mathbb (\phi_e^k) = \phi_^$

Proof outline

Let $A, B \subseteq \mathbb$ be two sets and assume that there are injective, total computable functions $f, g : \mathbb \to \mathbb$ such that for all $x \in \mathbb$, $x \in A \iff f(x) \in B$ and $x \in B \iff g(x) \in A$. We want to construct $h : \mathbb \to \mathbb$ total computable and bijective such that for all $x \in \mathbb$, $x \in A \iff h(x) \in B$.

As in most proofs of the Schröder-Bernstein theorem, we use an analysis of the "chains" formed by successive applications of $f$ and $g$. Informally, we think of two "copies" of $\mathbb$ between which we want to construct a bijection, and we consider an integer in the first copy, which is sent by $f$ to an integer in the second copy, which is in turn sent by $g$ to an integer in the first copy, etc. (These copies are blue and green in the pictures opposite.) Because $f$ and $g$ are injective, these chains do not "overlap" (there cannot be a merge between two chains). Depending on what happens when starting from some element and walking back on the chain, there are three possible types of chains:

* One-sided chains, where this eventually stops on an element which has no preimage by $f$ or $g$.
* Two-sided chains, where this continues indefinitely without looping back.
* Cycles, where this ultimately yields an element already seen.

To construct a bijection in the context of the Schröder-Bernstein theorem, it suffices to pair the elements along each chain: on a one-sided chain, use $f$ or $g$ depending on the color of the first element, and on a two-sided chain or cycle, either one can be used. For Myhill's theorem, this does not work since the constructed bijection need not be computable.

Instead, we build the bijection by successively pairing elements. At each stage, we take the next unpaired element from the blue copy of $\mathbb$ and pair it with some unpaired element of the green copy, then we do the same with the next unpaired element from the green copy. This ensures that every element of both copies is paired at some point.

Suppose we want to pair some blue element (the case of a green element is symmetric). The idea is to apply $f$ to get the next green element on the chain, and if this element is unpaired, use it to pair with our blue element. If it is paired, then apply $g$ then $f$ to advance to the next green element in the chain, and repeat until an un-paired green element is found.

To compute this bijection effectively, an algorithm can compute the pairs until its input is paired, and return the other element of the pair.

See also

* Berman–Hartmanis conjecture, an analogous statement in computational complexity theory.

References

*.
*{{citation
, last = Rogers , first = Hartley Jr. , author-link = Hartley Rogers, Jr.
, edition = 2nd
, isbn = 0-262-68052-1
, location = Cambridge, MA
, mr = 886890
, publisher = MIT Press
, title = Theory of recursive functions and effective computability
, year = 1987.
*Soare, Robert I. (1987), ''Recursively enumerable sets and degrees : a study of computable functions and computably generated sets,'' Perspectives in Mathematical Logic, Berlin Heidelberg : Springer-Verlag, ISBN 978-3-540-66681-3, MR 0882921

Computability theory