Super-recursive algorithm

In computability theory, super-recursive algorithms are posited as a generalization of hypercomputation: hypothetical algorithms that are more powerful, that is, compute more than Turing machines. The term was introduced by Mark Burgin, whose book Super-recursive algorithms develops their theory and presents several mathematical models.

Source: Wikipedia — Super-recursive algorithm (CC BY-SA 4.0)

Super-recursive algorithm

In computability theory, super-recursive algorithms are posited as a generalization of hypercomputation: hypothetical algorithms that are more powerful, that is, compute more than Turing machines. The term was introduced by Mark Burgin, whose book Super-recursive algorithms develops their theory and presents several mathematical models.

This neuron ends here.

Source: Wikipedia "Super-recursive algorithm" · CC BY-SA 4.0

Privacy Policy