Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Super-recursive algorithm
open-in-new
<p>In <a href="/facts/Computability_theory/cqDfXwdf">computability theory</a>, super-recursive algorithms are posited as a generalization of <a href="/facts/Hypercomputation/kd5tEVBa">hypercomputation</a>: hypothetical <a href="/facts/Algorithm/fnl5NmRt">algorithms</a> that are more powerful, that is, compute more than <a href="/facts/Turing_machines/ojCtglYu">Turing machines</a>. </p><p>The term was introduced by Mark Burgin, whose book <i>Super-recursive algorithms</i> develops their theory and presents several mathematical models. </p><p>Burgin argues that super-recursive algorithms can be used to disprove the <a href="/facts/Church%25E2%2580%2593Turing_thesis/hDHn641f">Church–Turing thesis</a>. This point of view has been criticized within the mathematical community and is not widely accepted. </p>