halting algorithm
[/ˈhɔːltɪŋ ˈælɡərɪðəm/]
nounpl: halting algorithms
algoritmo de parada
1. An algorithm that is guaranteed to terminate and produce a result after a finite number of steps, as opposed to running indefinitely or entering an infinite loop
A well-designed sorting algorithm is a halting algorithm because it will always complete within a predictable timeframe.
Um algoritmo de ordenação bem projetado é um algoritmo de parada porque sempre será concluído dentro de um prazo previsível.
2. In computability theory, an algorithm for which there exists a proof that it will halt for all possible inputs
Proving that a program is a halting algorithm is a central concern in formal verification.
Provar que um programa é um algoritmo de parada é uma preocupação central na verificação formal.
This is a specialized term primarily used in academic and professional computer science contexts in both English and Portuguese-speaking countries. In Brazil, it is commonly taught in computer science programs and appears in technical documentation. The term reflects the importance of algorithm reliability and predictability in software development, a concern that transcends cultural boundaries in the global tech industry.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →