Enumerable classes of total recursive functions: complexity of inductive inference
| Authored By: | A. Ambainis and J. Smotrovs |
| Paper Title: | Enumerable classes of total recursive functions: complexity of inductive inference |
| Book/Journal Title: | Proc. 5th Int. Workshop on Algorithmic Learning Theory |
| Publisher: | Springer-Verlag |
| Publication Date: | 1994 |
| Pages: | 10-25 |