finite algorithm
[ˈfɪnɪt ˈælɡərɪðəm]
nounpl: finite algorithms
algoritmo finito
1. A computational procedure that is guaranteed to terminate after a finite number of steps, producing a result or determining that no solution exists
The Euclidean algorithm is a finite algorithm for finding the greatest common divisor of two integers.
O algoritmo euclidiano é um algoritmo finito para encontrar o máximo divisor comum de dois inteiros.
2. An algorithm with a predetermined upper bound on the number of operations or iterations required to complete
A finite algorithm must have a clear termination condition to avoid infinite loops.
Um algoritmo finito deve ter uma condição clara de encerramento para evitar loops infinitos.
This is a technical term primarily used in academic and professional computer science contexts. In Brazil, it is commonly taught in undergraduate computer science programs and used in discussions of algorithm design and analysis. The concept is fundamental to distinguishing between practical algorithms and theoretical constructs that may not terminate.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →