Solomonoff's theory of inductive inferenceSolomonoff's theory of inductive inference is a mathematical theory of induction introduced by Ray Solomonoff, based on probability theory and theoretical computer science. In essence, Solomonoff's induction derives the posterior probability of any computable theory, given a sequence of observed data. This posterior probability is derived from Bayes' rule and some universal prior, that is, a prior that assigns a positive probability to any computable theory.
Problem of inductionFirst formulated by David Hume, the problem of induction questions our reasons for believing that the future will resemble the past, or more broadly it questions predictions about unobserved things based on previous observations. This inference from the observed to the unobserved is known as "inductive inferences", and Hume, while acknowledging that everyone does and must make such inferences, argued that there is no non-circular way to justify them, thereby undermining one of the Enlightenment pillars of rationality.
Balance wheelA balance wheel, or balance, is the timekeeping device used in mechanical watches and small clocks, analogous to the pendulum in a pendulum clock. It is a weighted wheel that rotates back and forth, being returned toward its center position by a spiral torsion spring, known as the balance spring or hairspring. It is driven by the escapement, which transforms the rotating motion of the watch gear train into impulses delivered to the balance wheel.
ThereminThe theremin (ˈθɛrəmɪn; originally known as the ætherphone/etherphone, thereminophone or termenvox/thereminvox) is an electronic musical instrument controlled without physical contact by the performer (who is known as a thereminist). It is named after its inventor, Leon Theremin, who patented the device in 1928. The instrument's controlling section usually consists of two metal antennas which function not as radio antennas but rather as position sensors.
Recursive definitionIn mathematics and computer science, a recursive definition, or inductive definition, is used to define the elements in a set in terms of other elements in the set (Aczel 1977:740ff). Some examples of recursively-definable objects include factorials, natural numbers, Fibonacci numbers, and the Cantor ternary set. A recursive definition of a function defines values of the function for some inputs in terms of the values of the same function for other (usually smaller) inputs.
