• Publications
  • Influence
Comparison of Identification Criteria for Machine Inductive Inference
Abstract A natural ωpLω+1 hierarchy of successively more general criteria of success for inductive inference machines is described based on the size of sets of anomalies in programs synthesized byExpand
Inductive Inference: Theory and Methods
This survey highlights and explains the main ideas that have been developed in the study of inductive inference, with special emphasis on the relations between the general theory and the specific algorithms and implementations. Expand
The Power of Pluralism for Automatic Program Synthesis
The trade-offs between the number of IIMs involved in the learnmg process and the generality of the criteria of success are examined. Expand
On the Role of Procrastination in Machine Learning
Hierarchies of classes of learnable phenomena (represented by sets of recursive functions) isomorphic to the structure of the constructive ordinals are revealed, indicating a potential advantage of procrastination as a learning technique. Expand
On the role of procrastination for machine learning
A needled, non-woven pile fabric comprises a non-woven backing fabric and a non-woven face fabric. The face fabric has its face side printed with an ornamental pattern of pigment color. The backingExpand
A Logic of Discovery
In this logic, true sentences are discovered over time based on arriving data and a notion of expectation is introduced to reflect the growing certainty that a universally quantified sentence is true as more true instances are observed. Expand
On the Intrinsic Complexity of Learning
The results indicate that the complexity notion captured by the new notion of reduction differs dramatically from the traditional studies of the complexity of the algorithms performing learning tasks. Expand
Three Decades of Team Learning
A Recursive Introduction to the Theory of Computation
  • Carl H. Smith
  • Computer Science
  • Graduate Texts in Computer Science
  • 14 October 1994
Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms and the notion of a complexity measure is introduced. Expand