Technical Reports

The ICICS/CS Reading Room


UBC CS TR-84-20 Summary

An Alternative Characterization of Precomplete Numerations, November 1984 K and Akira a

Er\u{s}ov [1] characterized precomplete numerations as those numerations which satisfy the 2nd recursion theorem. In this short note we show that they are exactly those numerations which satisfy the strongest form of the 2nd recursion theorem.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.