Recursive function: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Revision as of 06:11, 22 August 2017 edit Trovatore (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 39,109 edits why "total" specifically? Partial recursive == partial computable, total recursive == total computable. I'm not aware of any convention requiring recursive functions to be total and computable ones not. ← Previous edit		Latest revision as of 10:00, 21 April 2021 edit undo Jordan Mitchell Barrett (talk \| contribs) Extended confirmed users 550 edits m Added link to "computable function" Tag: Visual edit
(6 intermediate revisions by 4 users not shown)
Line 1: '''Recursive function''' may refer to: [[~~Recursion~~Recursive function (~~computer science~~programming)]], a ~~procedure or subroutine, implemented in a programming language, whose~~function ~~implementation~~which references itself [[General recursive function]], a computable partial function from natural numbers to natural numbers A [[computable function]]▼ [[Primitive recursive function]], a function which can be computed with loops of bounded length ▲AAnother name for [[computable function]] ==See also== [[Recurrence relation]]~~, in mathematics~~, an equation ~~that~~which defines a sequence ~~recursively~~from initial values▼ [[μ-recursive function]], defined from a particular formal model of computable functions using primitive recursion and the μ operator [[Recursion theory]], the study of computability ▲[[Recurrence relation]], in mathematics, an equation that defines a sequence recursively {{disambig}}