【其它】计算理论小知识点

Ch 1. Computable Functions

Definition 1.1

$$expression$$
An expression is a finite sequence (possibly empty) of symbols chosen from the list: ${q}_{1}, {q}_{2}, {q}_{3}, . . . ; {S}_{0}, {S}_{1}, {S}_{2}, . . . ; R, L.$

Definition 1.2

$$quadruple$$
A quadruple is an expression having one of the following forms:
(1) ${q}_{i}\ {S}_{j}\ {S}_{k}\ {q}_{l}.$
(2) ${q}_{i}\ {S}_{j}\ R\ {q}_{l}.$
(3) ${q}_{i}\ {S}_{j}\ L\ {q}_{l}.$
(4) ${q}_{i}\ {S}_{j}\ {q}_{k}\ {q}_{l}.$
$$simple$$
If none of the quadruples of a Turing machine $Z$ is of the type 4, $Z$ is called simple.

Definition 1.3

Definition 1.4

$$instantaneous\ description$$

Definition 1.5

$$tape\ expression$$

Definition 1.6

internal configuration of $Z$ at $\alpha$
symbol scanned by $Z$ at $\alpha$
expression on the tape of $Z$ at $\alpha$

Definition 1.7

$$\alpha \rightarrow \beta$$

Theorem 1.1

Theorem 1.2

Definition 1.8

terminal with respect to $Z$

Definition 1.9

${\alpha}_{p} = {Res}_{Z}({\alpha}_{1})$ and we call ${\alpha}_{p}$ the resultant of ${\alpha}_{1}$ with respect to $Z$.

Definition 2.1

$$\overline{n} = {1}^{n+1}$$
With each number $n$ we associate the tape expression $\overline{n}$ where $\overline{n} = {1}^{n+1}.$

Definition 2.2

$$(\overline{{n}_{1}, {n}_{2}, . . . , {n}_{k}}) = \overline{{n}_{1}}B\overline{{n}_{2}}B . . . B\overline{{n}_{k}}.$$
With each $k$-tuple $({n}_{1}, {n}_{2}, . . . , {n}_{k})$ of integers we associate the tape expression $(\overline{{n}_{1}, {n}_{2}, . . . , {n}_{k}})$, where $$(\overline{{n}_{1}, {n}_{2}, . . . , {n}_{k}}) = \overline{{n}_{1}}B\overline{{n}_{2}}B . . . B\overline{{n}_{k}}.$$
Thus, $(\overline{2, 3, 0}) = 111B1111B1.$

Definition 2.3

Let $M$ be any expression. Then $\left\langle M \right\rangle$ is the number of occurrences of 1 in $M$.
Thus, $\left\langle 11B{S}_{4}{q}_{3} \right\rangle = 2; \left\langle {q}_{3}{q}_{2}{S}_{5}\right\rangle = 0; \left\langle \overline{m-1} \right\rangle = m.$

Ch 2. Operations on Computable Functions

Definition 1.1

$$\theta(Z)$$
If $Z$ is a Turing machine, we let $\theta(Z)$ be the largest number $i$ such that ${q}_{i}$ is an internal configuration of $Z$.

Definition 1.2

$$n-regular$$
A Turing machine $Z$ is called $n$-regular (n>0) if
(1) There is an $s$ > 0 such that, whenever ${{Res}_{Z}}^{A}\left[{q}_{1}(\overline{{m}_{1}, . . . , {m}_{n}})\right]$ is defined, it has the form ${q}_{\theta(Z)}(\overline{{r}_{1}, . . . , {r}_{s}})$ for suitable ${r}_{1}, . . . , {r}_{s}$, and
(2) No quadruple of $Z$ begins with ${q}_{\theta(Z)}$.

$n$-regular Turing machines present the results of a computation (“outputs”) in a form suitable for use (as “inputs”) at the beginning of a new computation by another Turing machine.

Definition 1.3

$${Z}^{(n)}: {q}_{i} \rightarrow {q}_{n+i}$$
Let $Z$ be a Turing machine. Then ${Z}^{(n)}$ is the Turing machine obtained from $Z$ by replacing each internal configuration ${q}_{i}$, at all of its occurrences in quadruples of $Z$, by ${q}_{n+i}$.

Lemma 1.

$$Z'$$
For every Turing machine $Z$, we can find a Turing machine $Z'$ such that, for each n, $Z'$ is $n$-regular, and, in fact,
$${{Res}_{Z'}}^{A}\left[{q}_{1}(\overline{{m}_{1}, . . . , {m}_{n}})\right] = {q}_{\theta(Z')}\overline{\psi_{Z;A}^{(n)}({{m}_{1}, . . . , {m}_{n}})}.$$
This lemma enables us to rewrite the numerical result of a computation in such a form that it is available for use as the beginning of a new computation.