Revision as of 02:47, 3 July 2007 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits badly needed initial context ← Previous edit		Revision as of 22:11, 22 August 2007 edit undo Davecrosby uk (talk \| contribs) Extended confirmed users 12,966 edits m Typo correction - You can help! Next edit →
Line 5: Members of <math>L_\alpha</math> are called <math>\alpha</math> finite and play a similar role to the finite numbers in classical recursion theory. We say R is a reduction procedure if it is recursively enumerable and every ~~memeber~~member of R is of the form <math> \langle H,J,K\rangle </math> where ''H'', ''J'', ''K'' are all α-finite. ''A'' is said to be α-recusive in ''B'' if there exist <math>R_0,R_1</math> reduction procedures such that:

Alpha recursion theory: Difference between revisions