IssaRice: Created page with "In computability theory, if we have some numbering $\varphi_0, \varphi_1, \varphi_2, \ldots$ of computable partial functions then..."

2018-12-18T06:58:35Z

Created page with "In computability theory, if we have some numbering <math>\varphi_0, \varphi_1, \varphi_2, \ldots</math> of [[../Computable partial function|computable partial functions]] then..."

New page

In computability theory, if we have some numbering <math>\varphi_0, \varphi_1, \varphi_2, \ldots</math> of [[../Computable partial function|computable partial functions]] then the number <math>e</math> is called the '''index''' of <math>\varphi_e</math>, i.e., <math>\varphi_e</math> is the <math>e</math>th computable partial function.

We can also think of <math>e</math> as the source code of an algorithm computing <math>\varphi_e</math>.

User:IssaRice/Computability and logic/Index and program - Revision history

IssaRice: Created page with "In computability theory, if we have some numbering \varphi_0, \varphi_1, \varphi_2, \ldots of computable partial functions then..."

IssaRice: Created page with "In computability theory, if we have some numbering $\varphi_0, \varphi_1, \varphi_2, \ldots$ of computable partial functions then..."