Skip to content

OmniGlobe EternalTimeline KnowNet CosmosLive BioSphere CulturaVault·All

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

Phase 0 · scaffold

computability theory · Vinony

EntityQ818930· pop 43

computability theory

Sign in to save

study of computable functions and Turing degrees

Connections

recursively enumerable set

Gödel's incompleteness theorems

arithmetical hierarchy

semantic theory of truth

mathematical logic

analog computer

first-order logic

Stephen Cole Kleene

Yuri Matiyasevich

primitive recursive function

semantics of logic

Sources

wikipedia.externallinksexternallink

Similar entities

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

Church–Turing thesis

Entitydist 0.24

Entitydist 0.26

Turing reduction

Entitydist 0.26

computable function

Entitydist 0.32

Grzegorczyk hierarchy

Entitydist 0.35

Entitydist 0.37

Kleene's recursion theorem

Entitydist 0.37

Turing completeness

Entitydist 0.37

Entitydist 0.37

Entitydist 0.37

Blum's speedup theorem

Entitydist 0.38

μ-recursive function

Entitydist 0.40