User:IssaRice/Computability and logic/Index and program

From Machinelearning
Revision as of 06:58, 18 December 2018 by IssaRice (talk | contribs) (Created page with "In computability theory, if we have some numbering <math>\varphi_0, \varphi_1, \varphi_2, \ldots</math> of computable partial functions then...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

In computability theory, if we have some numbering φ0,φ1,φ2, of computable partial functions then the number e is called the index of φe, i.e., φe is the eth computable partial function.

We can also think of e as the source code of an algorithm computing φe.