Can I read Effective Enumerations of Families of Finite Sets of Natural Numbers on EtoBox?

Effective Enumerations of Families of Finite Sets of Natural Numbers by Angel V. Ditchev is a Computer Science article available to read on EtoBox.

What is Effective Enumerations of Families of Finite Sets of Natural Numbers about?

We construct a universal r.e. set in the following manner: For any (n, x) we construct a set Un,, E 8 such that the set of all (z, n, x ) such that z E U,,,, is r.e. We construct the set Un,x by steps, and on step s we build a finite approximation U,,.x,s of U,,,,, and finally we take Let us describe the construction of the set lJ,,x., on step s for any R, x E N. We consider two Case I. V y ( y 5 s + G(F(n), x, y ) = 0). Take Un,x.s = E F ( n ) . ## Case 11. 3 y ( y 5 s + G ( F ( n ) , x, y ) * 0). Now take U n , x , s = Wn,yn)).s. Thus the construction is completed. Obviously, the predicate u E U,,x,s is r.e. relatively to z, n, x, s. We fix Un,, = USE N Un,x.s. First of all, we shall see that Un, E 8 for all natural numbers n and x. We consider two Case 1. V y ( G ( F ( n ) , x, y ) = 0). Then F(n) E Z, i.e. EF(,,) E 8 and for any s, U,,,,, = Case 11. 3 y ( G ( F ( n ) , x, y ) \* 0). Let y o be the least y such that G ( F ( n ) , x, y ) \* 0. Then

Who reads Effective Enumerations of Families of Finite Sets of Natural Numbers?

Author

Angel V. Ditchev

Publisher

John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Ltd.; Wiley (ISSN 0044-3050)

Published

1991

Language

EN

Field

Computer Science (Physical Sciences)