O'Reilly logo

Recursion Theory by Liang Yu, Chi Tat Chong

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Note that for each n and α < α′ < image, the number of splitting nodes along (xin, fin) in Ti[α] is greater than or equal to that in Ti[α′].

One may use T2[α] to define a Σ1(image-approximation image of image “from the left”: image (O) [α] ⌢…⌢ (n)[α] is the leftmost string ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required