A function \(f : \mathbb N^k \to \mathbb N\) is GOTO-computable, if there exists a unit-cost Random Access Machine \(M\) with a finite \(G O T O\) program \(P\), such that the machine \(M\) computes the output \(m\in \mathbb N\) for every input of \(k\) natural numbers \((n_1,\ldots,n_k)\in\mathbb N^k\), i.e.
\[f(n_1,\ldots,n_k)=m\]
in the following way: Given the initial state of registers of \(M\) \(r_i:=n_i\) for \(1\le i\le k\) and \(r_i:=0\) for \(i > k\), \(M\) starts the \(G O T O\) program \(\mathtt {P}\) and terminates at a new state such that * \(r_i=n_i\) for \(1\le i\le k\) (i.e. the initial register states remain unchanged), * \(r_{k+1}=m\) (i.e. the next register contains the output), and * \(r_i=0\) for \(i > k + 1\).
The set of all GOTO-computable functions is denoted by \(G O T O\).
The function \(f : \mathbb N^k \to \mathbb N\) is partially GOTO-computable, if there is a subset \(S^k\subseteq\mathbb N^k\), for which the restriction \({f|}_{S^k} : \mathbb N^k \to \mathbb N\) is GOTO-computable and for every input \((n_1,\ldots,n_k)\in\mathbb N^k\setminus S^k\) the machine \(M\) behaves as follows: Given the initial state of registers of \(M\) \(r_i:=n_i\) for \(1\le i\le k\) and \(r_i:=0\) for \(i > k\), \(M\) starts the \(G O T O\) program \(\mathtt {P}\) and never terminates. In this case, we set \[f(n_1,\ldots,n_k)=\text{undefined}.\]
The set of all partially GOTO-computable functions is denoted by \(G O T O^{part}\).
Theorems: 1