recursion theory
[rɪˈkɜrʒən ˈθiːəri]
noun
teoria da recursão
1. A branch of mathematical logic and computer science that studies computable functions and the formal definition of what can be computed algorithmically
Recursion theory provides the theoretical foundation for understanding which problems can be solved by algorithms.
A teoria da recursão fornece a base teórica para compreender quais problemas podem ser resolvidos por algoritmos.
2. The study of recursive functions, computability, and the Turing-computable functions
In recursion theory, we examine the properties of functions that can be computed step by step.
Na teoria da recursão, examinamos as propriedades de funções que podem ser calculadas passo a passo.
3. An academic discipline dealing with decision problems, the halting problem, and degrees of unsolvability
Recursion theory helps us understand the fundamental limits of computation.
A teoria da recursão nos ajuda a compreender os limites fundamentais da computação.
Recursion theory emerged as a formal discipline in the 1930s-1940s through the work of mathematicians like Alan Turing, Alonzo Church, and Kurt Gödel. It is fundamental to theoretical computer science and mathematical logic education in both Brazilian and Portuguese universities, as well as in North America. The field is often taught in graduate-level mathematics and computer science programs.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →