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

Construction

Step 0. Define T0 = 2<ω and σ0 = image.

Step n + 1. There are three substeps:

Substep 1 (Coding x). For each k, if x(n) = 0 then define image = image. Otherwise, let image = image. Define Tn+1,0,k = . Hence there is a recursive oracle functional Φik such that for ...

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