Turing degree
measurement for the level of algorithmic unsolvability of a set
Facts
2 properties- Instance of
- mathematical concept
- Named after
- Alan Turing[1]
🏷️ Also known as
en Turing degree of unsolvability
en Turing degrees of unsolvability
en unsolvability (mathematical logic)
en degree of unsolvability
en degrees of unsolvability
en Turing degree
da Turing-grad
da Turinggrad
de Grad der Unlösbarkeit
fr degré de Turing
ja チューリング次数
pt grau de Turing
uk Степінь Тюрінга
zh 不可解度
🔖 Identifiers · 7
- Library of Congress Authorities ID
- sh85141199
- FAST ID
- 1162046
- Freebase ID
- /m/039hr_
- J9U entity ID
- 987007529781805171
- JSTOR topic ID (archived)
- degree-of-unsolvability
- Microsoft Academic ID (discontinued)
- 47612047
- Yale LUX ID
- concept/e864d5af-cb7d-4ab0-8dee-2a5316dd065b
Press Enter · cited answer in seconds