General recursive function: Difference between revisions

Revision as of 14:09, 12 April 2021

Revision as of 22:57, 26 April 2021

Line 33:

== Total recursive function ==

A general recursive function is called '''total recursive function''' if it is defined for every input, or, equivalently, if it can be computed by a [[total Turing machine]].{{cn|date=April 2021}}There is no way to computably tell if a given general recursive function is total - see ''[[Halting problem]]''.

Given a general recursive function, it is generally impossible to decide whether it is a total one, see ''[[Halting problem]]''.

== Equivalence with other models of computability ==