Se conoce como algoritmo a un conjunto de instrucciones o reglas claramente definidas que ofrecen una solución a un problema o tarea específicos. Los algoritmos, cuyas raíces se remontan a las civilizaciones antiguas, han evolucionado durante siglos y hoy desempeñan un papel fundamental en la informática contemporánea. En su creación se utilizan técnicas como el divide y vencerás, y su eficiencia se evalúa mediante métricas como la notación big O. Los algoritmos pueden representarse de múltiples formas, como pseudocódigo, diagramas de flujo o lenguajes de programación. Para ejecutarlos, se traducen a un lenguaje comprensible para los ordenadores, y la velocidad de ejecución depende del conjunto de instrucciones utilizado. Dependiendo de su diseño o paradigma de implementación, los algoritmos pueden clasificarse de forma diferente, y su nivel de eficiencia puede afectar en gran medida al tiempo de procesamiento. En campos como la informática y la inteligencia artificial, la comprensión y aplicación eficaz de los algoritmos es vital. inteligencia artificial[1], the comprehension and effective application of algorithms is vital.
En mathematics y informática, an algoritmo (/ˈælɡərɪðəm/ ⓘ) es una finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing calculations y data processing. More advanced algorithms can use conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning), achieving automatización eventually. Using human characteristics as descriptors of machines in metaphorical ways was already practiced by Alan Turing with terms such as "memory", "search" and "stimulus".
In contrast, a heuristic is an approach to problem solving that may not be fully specified or may not guarantee correct or optimal results, especially in problem domains where there is no well-defined correct or optimal result. For example, social media recommender systems rely on heuristics in such a way that, although widely characterized as "algorithms" in 21st century popular media, cannot deliver correct results due to the nature of the problem.
As an effective method, an algorithm can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.
Español 
English 
Français