Concept information
Término preferido
computability theory
Definición
-
Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since expanded to include the study of generalized computability and definability. In these areas, computability theory overlaps with proof theory and effective descriptive set theory.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Computability_theory)
Concepto genérico
Conceptos específicos
etiqueta alternativa (skos)
- recursion theory
En otras lenguas
-
francés
-
théorie de la récursion
URI
http://data.loterre.fr/ark:/67375/PSR-WG0SLJKC-4
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}