 algorithm

—algorithmic, adj./al"geuh ridh'euhm/, n.a set of rules for solving a problem in a finite number of steps, as for finding the greatest common divisor.[189095; var. of ALGORISM, by assoc. with Gk arithmós number. See ARITHMETIC]
* * *
Procedure that produces the answer to a question or the solution to a problem in a finite number of steps.An algorithm that produces a yes or no answer is called a decision procedure; one that leads to a solution is a computation procedure. A mathematical formula and the instructions in a computer program are examples of algorithms. Euclid's Elements (с 300 BC) contained an algorithm for finding the greatest common divisor of two integers. Manipulation of lists (searching for, inserting, and removing items) can be done efficiently by using algorithms.* * *
systematic procedure that produces—in a finite number of steps—the answer to a question or the solution of a problem. The name derives from the Latin translation, Algoritmi de numero Indorum, of the 9thcentury Muslim mathematician alKhwarizmi (Khwārizmī, al)'s arithmetic treatise “AlKhwarizmi Concerning the Hindu Art of Reckoning.”For questions or problems with only a finite set of cases or values an algorithm always exists (at least in principle); it consists of a table of values of the answers. In general, it is not such a trivial procedure to answer questions or problems that have an infinite number of cases or values to consider, such as “Is the natural number (1, 2, 3, . . .) a prime?” or “What is the greatest common divisor of the natural numbers a and b?” The first of these questions belongs to a class called decidable; an algorithm that produces a yes or no answer is called a decision procedure (decision problem). The second question belongs to a class called computable; an algorithm that leads to a specific number answer is called a computation procedure.Algorithms exist for many such infinite classes of questions; Euclid's Elements, published about 300 BC, contained one for finding the greatest common divisor of two natural numbers. Every elementary school student is drilled in long division, which is an algorithm for the question “Upon dividing a natural number a by another natural number b, what are the quotient and the remainder?” Use of this computational procedure leads to the answer to the decidable question “Does b divide a?” (the answer is yes if the remainder is zero). Repeated application of these algorithms eventually produces the answer to the decidable question “Is a prime?” (the answer is no if a is divisible by any smaller natural number besides 1).Sometimes an algorithm cannot exist for solving an infinite class of problems, particularly when some further restriction is made upon the accepted method. For instance, two problems from Euclid's time requiring the use of only a compass and a straightedge (unmarked ruler)—trisecting an angle and constructing a square with an area equal to a given circle—were pursued for centuries before they were shown to be impossible. At the turn of the 20th century, the influential German mathematician David Hilbert (Hilbert, David) proposed 23 problems for mathematicians to solve in the coming century. The second problem on his list asked for an investigation of the consistency of the axioms of arithmetic. Most mathematicians had little doubt of the eventual attainment of this goal until 1931, when the Austrianborn logician Kurt Gödel (Gödel, Kurt) demonstrated the surprising result that there must exist arithmetic propositions (or questions) that cannot be proved or disproved. Essentially, any such proposition leads to a determination procedure that never ends (a condition known as the halting problem). In an unsuccessful effort to ascertain at least which propositions are unsolvable, the English mathematician and logician Alan Turing (Turing, Alan M.) rigorously defined the loosely understood concept of an algorithm. Although Turing ended up proving that there must exist undecidable propositions, his description of the essential features of any generalpurpose algorithm machine, or Turing machine, became the foundation of computer science. Today the issues of decidability and computability are central to the design of a computer program—a special type of algorithm.* * *
Universalium. 2010.
Look at other dictionaries:
algorithm — UK US /ˈælgərɪðəm/ noun [C] IT ► a set of mathematical instructions that must be followed in a fixed order, and that, especially if given to a computer, will help to calculate an answer to a mathematical problem: a computer/mathematical/search… … Financial and business terms
algorithm — n. a precise rule (or set of rules) specifying how to solve some problem; a set of procedures guaranteed to find the solution to a problem. Syn: algorithmic rule, algorithmic program [WordNet 1.5 +PJC] … The Collaborative International Dictionary of English
algorithm — [al′gə rith΄əm] n. [altered (after ARITHMETIC) < ALGORISM] 1. Math. a) any systematic method of solving a certain kind of problem b) the repetitive calculations used in finding the greatest common divisor of two numbers: called in full… … English World dictionary
Algorithm — [engl.], Algorithmus. … UniversalLexikon
algorithm — (n.) 1690s, from Fr. algorithme, refashioned (under mistaken connection with Gk. arithmos number ) from O.Fr. algorisme the Arabic numeral system (13c.), from M.L. algorismus, a mangled transliteration of Arabic al Khwarizmi native of Khwarazm,… … Etymology dictionary
algorithm — ► NOUN ▪ a process or set of rules used in calculations or other problem solving operations. DERIVATIVES algorithmic adjective. ORIGIN Latin algorismus, from an Arabic word meaning the man of Kw rizm , referring to a 9th century mathematician … English terms dictionary
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
algorithm — A systematic process consisting of an ordered sequence of steps, each step depending on the outcome of the previous one. In clinical medicine, a step by step protocol for management of a health care problem … Medical dictionary
algorithm — n. a sequential set of instructions used in calculations or problem solving. A reconstruction algorithm is a complex mathematical formula used by a computer to construct images from the data acquired by CT, MRI, or other scanners. A diagnostic… … The new mediacal dictionary
algorithm — noun /ˈælɡəɹɪðm/ A precise step by step plan for a computational procedure that begins with an input value and yields an output value in a finite number of steps. Informally, an algorithm is any well defined computational procedure that takes… … Wiktionary