Uncomputability: The problem of induction internalized (Q1434378)

A comparison of inductive reasoning with drawing conclusions from a Turing-machine computation that might not halt. This comes as no surprise to computability theorists. Indeed, the author admits, ``The basic idea is not new. It was pioneered by Putnam and Gold and has since then served as a fertile source of ideas within computational learning theory.'' The author could have presented the material more concisely by using standard computability-theory concepts and terminology such as c.e., co-c.e., computation relative to \(\mathbf {0}'\), etc.