undecidable process
[/ˌʌndɪˈsaɪdəbəl ˈprɑːses/]
nounpl: undecidable processes
processo indecidível
1. In computability theory and mathematical logic, a computational process or problem for which no algorithm can be devised to determine whether a given input has a specific property or will terminate in a finite number of steps
The halting problem is a classic example of an undecidable process in computer science.
O problema da parada é um exemplo clássico de um processo indecidível na ciência da computação.
2. A procedure or algorithm whose outcome cannot be determined algorithmically for all possible inputs
Gödel's incompleteness theorem demonstrates the existence of undecidable processes in formal mathematical systems.
O teorema da incompletude de Gödel demonstra a existência de processos indecidíveis em sistemas matemáticos formais.
This is a specialized technical term primarily used in academic and research settings in both Brazil and Portugal. It is fundamental to computer science and mathematical logic education and is used identically across Portuguese-speaking academic communities. The concept is particularly important in Brazilian universities with strong 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 →