Table approximations to recursive predicates

The note deals with the complexity of the table approximations to the recursive predicates. In particular it is shown, that any table approximation to given recursive predicate may be essentially improved in infinitely many points.