Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

دالة عودية بدائية · Vinony

🌐العربية

English Deutsch Español Français Italiano Nederlands Português Русский العربية 한국어 中文日本語

EntityQ1570472· pop 16· linked from 411 articles

دالة عودية بدائية

Also known as primitive recursion

function that can be computed with loops of bounded length

Available in 16 languages

Español
Français
Deutsch
中文
日本語
Português
Italiano
العربية
Catalan
Czech

Connections

μ-recursive function

Categories

Computability theory Functions and mappings Recursion Theory of computation

Sources

wikipedia.externallinksexternallink

What links here411 pages

Knuth's up-arrow notation

μ-recursive function

well-founded relation

axiom of constructibility

Heyting arithmetic

counter machine

halting problem

computability theory

theory of computation

random-access machine

Mostowski collapse lemma

typed lambda calculus

three-valued logic

Cantor's paradox

lambda calculus

superseded scientific theory

logical contradiction

compactness theorem

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

McCarthy 91 function

Entitydist 0.41

Entitydist 0.63

piecewise function

Entitydist 0.67

function approximation

Entitydist 0.67

one-way function

Entitydist 0.72

Entitydist 0.72

algebraic function

Entitydist 0.72

Entitydist 0.72

quintic function

Entitydist 0.73

Padé approximant

Entitydist 0.73

key derivation function

Entitydist 0.73

Heaviside step function

Entitydist 0.76

via Wikidata sitelinks · CC0

recursively enumerable set

Entity

semantic theory of truth

mathematical logic

Dennis M. Ritchie

Gödel's incompleteness theorems

logical disjunction

first-order logic

Turing completeness

partial function

Gödel numbering

semantics of logic

Sign in to save