Construction
Step 0. Define T0 = 2<ω and σ0 = 
.
Step n + 1. There are three substeps:
Substep 1 (Coding x). For each k, if x(n) = 0 then define 
= 
. Otherwise, let = 
. Define Tn+1,0,k = . Hence there is a recursive oracle functional Φik such that for ...
Get Recursion Theory now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
