uncomputable functions
[/ʌnkəmˈpjuːtəbəl ˈfʌŋkʃənz/]
nounpl: uncomputable functions
funções não computáveis
1. Mathematical functions that cannot be calculated by any algorithm or Turing machine, regardless of computational resources or time available
The Busy Beaver function is a classic example of uncomputable functions that grows faster than any computable function.
A função Busy Beaver é um exemplo clássico de funções não computáveis que crescem mais rapidamente que qualquer função computável.
2. Functions for which no algorithm exists that can compute the exact value for all possible inputs
Halting problem solutions demonstrate uncomputable functions in theoretical computer science.
As soluções do problema da parada demonstram funções não computáveis na ciência da computação teórica.
This is specialized terminology used primarily in academic and research contexts within computer science and mathematical logic. It represents a fundamental concept in computability theory that emerged from work by Alan Turing, Alonzo Church, and Kurt Gödel in the early 20th century. The concept is equally recognized and used in both Brazilian and American academic communities.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →