Q818930

From Wikidata
Jump to: navigation, search

computability theory (Q818930)[edit]

branch of mathematical logic, computer science, and the theory of computation studying computable functions and Turing degrees [edit]

Also known as:
  • recursion theory

Statements

Language Code Linked page
العربية arwiki [edit]
অসমীয়া aswiki [edit]
български bgwiki [edit]
বাংলা bnwiki [edit]
català cawiki [edit]
čeština cswiki [edit]
dansk dawiki [edit]
Deutsch dewiki [edit]
Ελληνικά elwiki [edit]
English enwiki [edit]
español eswiki [edit]
فارسی fawiki [edit]
עברית hewiki [edit]
hrvatski hrwiki [edit]
italiano itwiki [edit]
日本語 jawiki [edit]
한국어 kowiki [edit]
Latina lawiki [edit]
polski plwiki [edit]
português ptwiki [edit]
русский ruwiki [edit]
srpskohrvatski / српскохрватски shwiki [edit]
Simple English simplewiki [edit]
slovenčina skwiki [edit]
svenska svwiki [edit]
ไทย thwiki [edit]
українська ukwiki [edit]
中文 zhwiki [edit]
[add]
[add]
[add]
[add]
[add]
[add]