non-deterministic selection
[/ˌnɒn.dɪˌtɜːmɪˈnɪstɪk səˈlɛkʃən/]
nounpl: non-deterministic selections
seleção não-determinística
1. A computational process or algorithm where the selection of an element or path from multiple options is not predetermined or uniquely determined by the input, often used in theoretical computer science and automata theory
In non-deterministic selection, a finite automaton can transition to multiple states simultaneously from a single input symbol.
Na seleção não-determinística, um autômato finito pode fazer transição para múltiplos estados simultaneamente a partir de um único símbolo de entrada.
2. A mechanism in algorithms or systems where the choice between alternative options follows probabilistic or arbitrary rules rather than fixed logical conditions
The non-deterministic selection algorithm randomly chooses among valid solutions without a predictable pattern.
O algoritmo de seleção não-determinística escolhe aleatoriamente entre soluções válidas sem um padrão previsível.
This is a specialized technical term primarily used in academic and professional computer science contexts in both Brazil and Portugal. It reflects the international standardization of computational terminology and is essential for professionals working in algorithms, formal languages, artificial intelligence, and theoretical computer science. The term is language-agnostic in most technical environments and maintains consistent meaning across Portuguese-speaking regions.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →