Abstract
We consider programs that accept descriptions of inductive inference problems and return machines that solve them. Several design specifications for synthesizers of this kind are considered from a recursion-theoretic perspective.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 138-161 |
| Number of pages | 24 |
| Journal | Information and Computation |
| Volume | 77 |
| Issue number | 2 |
| DOIs | |
| State | Published - May 1988 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics