non-terminating algorithm
[/nɑːn tɜːrˈmɪneɪtɪŋ ˈælɡərɪðəm/]
nounpl: non-terminating algorithms
algoritmo não-terminante
1. An algorithm that never reaches a final state or completion, either intentionally or due to logical error; it continues executing indefinitely without producing a result or halting
The program contained a non-terminating algorithm that created an infinite loop, causing the system to freeze.
O programa continha um algoritmo não-terminante que criava um loop infinito, causando o travamento do sistema.
2. In computation theory, an algorithm for which there is no guarantee of halting for all possible inputs
Certain recursive functions can be non-terminating algorithms if base cases are not properly defined.
Certas funções recursivas podem ser algoritmos não-terminantes se os casos base não estiverem adequadamente definidos.
3. A process in computing that continues indefinitely, sometimes by design (such as server processes), and sometimes as an unintended consequence of poor programming logic
Web servers often run non-terminating algorithms designed to listen for client requests continuously.
Servidores web frequentemente executam algoritmos não-terminantes projetados para escutar requisições de clientes continuamente.
This is primarily a technical term used in computer science, software engineering, and mathematics education in both Brazil and the USA. In Brazilian universities, the term 'algoritmo não-terminante' is standard in computer science curricula. It represents an important concept in computational theory, particularly when discussing the halting problem and algorithm correctness. Understanding non-terminating algorithms is crucial for debugging and preventing system failures in software development.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →