Super-recursive algorithm
id:
super-recursive-algorithm-311-3788409
title:
Super-recursive algorithm
text:
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 co
brand slug:
wiki
category slug:
encyclopedia
description:
Generalization of ordinary algorithms that compute more than Turing machines
original url:
https://en.wikipedia.org/wiki/Super-recursive_algorithm
date created:
date modified:
2024-04-06T17:21:29Z
main entity:
{"identifier":"Q5295939","url":"https://www.wikidata.org/entity/Q5295939"}
image:
fields total:
13
integrity:
14