computable functions
[kəmˈpjuːtəbəl ˈfʌŋkʃənz]
nounpl: computable functions
funções computáveis
1. Functions that can be calculated or computed by an algorithm or Turing machine in a finite number of steps
Computable functions form the theoretical foundation of computer science and computability theory.
As funções computáveis formam a base teórica da ciência da computação e da teoria da computabilidade.
2. In mathematical logic and recursion theory, functions whose values can be effectively determined through a systematic procedure
The Ackermann function is an example of a total recursive function, but not all computable functions are primitive recursive.
A função de Ackermann é um exemplo de função recursiva total, mas nem todas as funções computáveis são recursivas primitivas.
This is a specialized term primarily used in academic and technical contexts within computer science, mathematics, and logic. It originated from theoretical computer science research in the 1930s-1950s and remains fundamental to modern computational theory in both Brazilian and international academic communities.
Related Idioms & Phrases
the Church-Turing thesis relates computable functions to effectively calculable functions
computable functions are closed under composition
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →