Citation Hunt

Leaderboard

The Wikipedia snippet below is not backed by a reliable source. Can you find one?

Click I got this! to go to Wikipedia and fix the snippet, or Next! to see another one. Good luck!

In page Church–Turing thesis:

This text has been unreferenced on Wikipedia for a very long time. If you can't find a source, be bold and remove it!

"

Several computational models allow for the computation of (Church-Turing) non-computable functions. These are known as hypercomputers. Mark Burgin argues that super-recursive algorithms such as inductive Turing machines disprove the Church–Turing thesis.[1] His argument relies on a definition of algorithm broader than the ordinary one, so that non-computable functions obtained from some inductive Turing machines are called computable. This interpretation of the Church–Turing thesis differs from the interpretation commonly accepted in computability theory, discussed above. The argument that super-recursive algorithms are indeed algorithms in the sense of the Church–Turing thesis has not found broad acceptance within the computability research community.[citation needed]