berekenbaarheidstheorie
Sign in to saveAlso known as recursion theory
study of computable functions and Turing degrees
In the Vinony graph
Within Vinony's link graph, berekenbaarheidstheorie is referenced by 741 other articles, and connects out to recursively enumerable set, Gödel's incompleteness theorems and arithmetical hierarchy.
It sits within the topics Computability theory and Mathematical logic.
Its subject is documented across 42 Wikipedia language editions.
Wikidata facts
- Subclass of
- theory of computation
Show 3 more facts
- topic's main category
- Category:Computability theory
- Commons category
- Computer science
- on focus list of Wikimedia project
- Wikipedia:Vital articles/Level/4
Sources (2)
via Wikidata · CC0
Connections
recursively enumerable set
Entity
Gödel's incompleteness theorems
Entity
arithmetical hierarchy
Entity
semantic theory of truth
Entity
Alan Turing
Entity
algorithm
Entity
mathematical logic
Entity
power set
Entity
analog computer
Entity
first-order logic
Entity
Peano axioms
Entity
formal system
Entity
Stephen Cole Kleene
Entity
The MIT Press
Entity
formal methods
Entity
Emil Leon Post
Entity
recursive set
Entity
Yuri Matiyasevich
Entity
primitive recursive function
Entity
semantics of logic
Entity