Recursion theory
Return to Recursion, Mathematical logic, Set theory, Set (mathematics), Proof theory, Model theory
Also called: Computability theory
- Snippet from Wikipedia: Computability theory
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.
Basic questions addressed by computability theory include:
- What does it mean for a function on the natural numbers to be computable?
- How can noncomputable functions be classified into a hierarchy based on their level of noncomputability?
Although there is considerable overlap in terms of knowledge and methods, mathematical computability theorists study the theory of relative computability, reducibility notions, and degree structures; those in the computer science field focus on the theory of subrecursive hierarchies, formal methods, and formal languages. The study of which mathematical constructions can be effectively performed is sometimes called recursive mathematics.
Math: Outline of mathematics, Mathematics research, Mathematical anxiety, Pythagorean Theorem, Scientific Notation, Algebra (Pre-algebra, Elementary algebra, Abstract algebra, Linear algebra, Universal algebra), Arithmetic (Essence of arithmetic, Elementary arithmetic, Decimal arithmetic, Decimal point, numeral system, Place value, Face value), Applied mathematics, Binary operation, Classical mathematics, Control theory, Cryptography, Definitions of mathematics, Discrete mathematics (Outline of discrete mathematics, Combinatorics), Dynamical systems, Engineering mathematics, Financial mathematics, Fluid mechanics (Mathematical fluid dynamics), Foundations of mathematics, Fudge (Mathematical fudge, Renormalization), Game theory, Glossary of areas of mathematics, Graph theory, Graph operations, Information theory, Language of mathematics, Mathematical economics, Mathematical logic (Model theory, Proof theory, Set theory, Type theory, Recursion theory, Theory of Computation, List of logic symbols), Mathematical optimization, Mathematician, Modulo, Mathematical notation (List of logic symbols, Notation in probability and statistics, Physical constants, Mathematical alphanumeric symbols, ISO 31-11), Numerical analysis, Operations research, Philosophy of mathematics, Probability (Outline of probability), Statistics, Mathematical structure, Ternary operation, Unary operation, Variable (mathematics), Glossary, Bibliography (Math for Data Science and DataOps, Math for Machine Learning and MLOps, Math for Programmers and Software Engineering), Courses, Mathematics GitHub. (navbar_math - see also navbar_variables)
© 1994 - 2024 Cloud Monk Losang Jinpa or Fair Use. Disclaimers
SYI LU SENG E MU CHYWE YE. NAN. WEI LA YE. WEI LA YE. SA WA HE.