In the Vinony graph
Vinony's link graph records 741 inbound references to 計算可能性理論, and connects out to recursively enumerable set, Gödel's incompleteness theorems and arithmetical hierarchy.
It is catalogued under topics including Computability theory and Mathematical logic.
Vinony links it to 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
Article · 日本語
計算可能性理論（けいさんかのうせいりろん、英: computability theory）とは、チューリングマシンなどの計算模型でいかなる計算問題が解けるか、またより抽象的に、計算可能な問題のクラスがいかなる構造をもっているかを調べる、計算理論や数学の一分野である。
Abstract from DBpedia / Wikipedia · CC BY-SA
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