Non-recursive function: Difference between revisions

Revision as of 13:47, 24 November 2018

Revision as of 13:47, 24 November 2018

Line 1:

'''Non-recursive function''' might refer to:

* [[Recursion (computer science)]]: a procedure or subroutine, implemented in a programming language, whose implementation references itself

* [[μ-recursive function]], defined from a particular formal model of computable fululunctionsfunctions using primitive recursion and the μ operator

* [[Computable function]], or total recursive function, a function computable by a [[Turing machine]]