0-computability
A query q is eventually computable if there exists a Web machine whose computation on input enc?(I) has the following properties:
- the content of the output tape at each point in the computation is a prefix of enc?(q(I)) , and
- for each o ? q(I), its encoding enc?(o) occurs on the output tape at some point in the computation
Unfortunately, all 0-computable queries are trivial, i.e. they only output the empty set!