Skip to content
ontologydriven
Sign out

Dictionary

Words, grammatical forms and meanings linked to the ontology.

recursive en · ADJ

Pronunciation

  • (Southern-England) audio
  • /ɹɪˈkɜː(ɹ)sɪv/

Etymology

Learned borrowing from New Latin recursīvus. Equivalent to recurse + -ive.

Meanings

  1. Drawing upon, invoking, or referring back to itself.
    • the recursive nature of stories which borrow from each other
  2. (not-comparable) Having to do with an object (typically a function or formula) which is defined in terms of the object itself.
  3. (not-comparable) Having to do with an algorithm, program, subroutine, procedure, function, or other block of code that calls itself.
  4. (not-comparable) Having to do with a function which can be computed by a theoretical model of a computer in a finite amount of time.
  5. (not-comparable) Having to do with a set whose characteristic function is recursive (sense 4).

Forms

SpellingFeaturesLabelsSource
most recursive Degree=Sup lexicographic
more recursive Degree=Cmp lexicographic

Antonyms

non-recursive

Deriveds

recursive definition · recursive humor · recursive conundrum · recursive function · filtered-popping recursive transition network · superrecursive · recursivity · recursiveness · recursively · right-recursive · transrecursive · co-recursive · recursion · recursive descent · recursive grammar · recursive compound word · subrecursive · recursive neural network · recursive acronym · nonrecursive · left-recursive

Hypernyms

recursively enumerable (of a set whose characteristic function is recursive)

Hyponyms

primitive recursive (of a function) · tail recursive (of a function)

Relateds

iterative · circular · fractal

Synonyms

self-referential

Translations (51)

el αναδρομικός (computing theory: of a function which can be computed in a finite amount of time) · fi itseään toistava (referring back to itself) · de rekursiv (computing theory: of a set whose characteristic function is recursive) · el αναδρομικός (referring back to itself) · cmn 遞歸 /递归 (computing: of an algorithm or block of code that calls itself) · nan 遞迴 /递回 (computing: of an algorithm or block of code that calls itself) · de rekursiv (mathematics: of a formula or object defined in terms of itself) · de rekursiv (computing: of an algorithm or block of code that calls itself) · pt recursivo (mathematics: of a formula or object defined in terms of itself) · pl rekurencyjny (computing: of an algorithm or block of code that calls itself) · nl recursief (mathematics: of a formula or object defined in terms of itself) · fr récursif (computing: of an algorithm or block of code that calls itself) · fa بازگشتی (computing theory: of a function which can be computed in a finite amount of time) · sh rekurzivan (computing theory: of a set whose characteristic function is recursive) · es iterativo (mathematics: of a formula or object defined in terms of itself) · nl recursief (computing: of an algorithm or block of code that calls itself) · es recursivo (computing: of an algorithm or block of code that calls itself) · pt recursivo (referring back to itself) · pl rekurencyjny (mathematics: of a formula or object defined in terms of itself) · uk рекурси́вний (referring back to itself) · sh рекурзиван (referring back to itself) · de rekursiv (computing theory: of a function which can be computed in a finite amount of time) · cs rekurzivní (computing: of an algorithm or block of code that calls itself) · fr récursif (referring back to itself) · es recursivo (referring back to itself) · el αναδρομικός (computing theory: of a set whose characteristic function is recursive) · es recurrente (mathematics: of a formula or object defined in terms of itself) · ar عَوْدِيّ (computing theory: of a function which can be computed in a finite amount of time) · fi rekursiivinen (computing: of an algorithm or block of code that calls itself) · nl recursief (computing theory: of a function which can be computed in a finite amount of time) · hu rekurzív (computing: of an algorithm or block of code that calls itself) · fr récursif (mathematics: of a formula or object defined in terms of itself) · fi rekursiivinen (mathematics: of a formula or object defined in terms of itself) · el αναδρομικός (computing: of an algorithm or block of code that calls itself) · pt recursivo (computing: of an algorithm or block of code that calls itself) · nl recursief (computing theory: of a set whose characteristic function is recursive) · de rekursiv (referring back to itself) · ro recursiv (computing: of an algorithm or block of code that calls itself) · fi rekursiivinen (computing theory: of a set whose characteristic function is recursive) · cs rekurzivní (mathematics: of a formula or object defined in terms of itself) · pt recursivo (computing theory: of a function which can be computed in a finite amount of time) · el αναδρομικός (mathematics: of a formula or object defined in terms of itself) · el επαναλαμβανόμενος (referring back to itself) · ar عَوْدِيّ (computing: of an algorithm or block of code that calls itself) · yue 遞迴 /递回 (computing: of an algorithm or block of code that calls itself) · ar عَوْدِيّ (computing theory: of a set whose characteristic function is recursive) · nl recursief (referring back to itself) · ar عَوْدِيّ (mathematics: of a formula or object defined in terms of itself) · fr récursif (computing theory: of a set whose characteristic function is recursive) · el επανερχόμενος (referring back to itself) · fi rekursiivinen (computing theory: of a function which can be computed in a finite amount of time)