Super-recursive algorithm

The topic of this article may not meet Wikipedia's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted. Find sources: "Super-recursive algorithm" – news · newspapers · books · scholar · JSTOR (February 2024) (Learn how and when to remove this message)

This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (February 2023) (Learn how and when to remove this message)

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.

Burgin argues that super-recursive algorithms can be used to disprove the Church-Turing thesis. This point of view has been criticized within the mathematical community and is not widely accepted.