Algorithm vs Maximax - What's the difference?

algorithm | maximax |


As nouns the difference between algorithm and maximax

is that algorithm is a precise step-by-step plan for a computational procedure that possibly begins with an input value and yields an output value in a finite number of steps while maximax is (economics|computer science|decision theory) a strategy or algorithm that seeks to maximize the maximum possible result (that is, that prefers the alternative with the chance of the best possible outcome, even if its expected outcome and its worst possible outcome are worse than other alternatives);.

algorithm

Alternative forms

* algorism (obsolete)

Noun

(en noun)
  • A precise step-by-step plan for a computational procedure that possibly begins with an input value and yields an output value in a finite number of steps.
  • * 1990 , Cormen, Leiserson, and Rivest, Introduction to Algorithms'': page 1. Cambridge, MA, The MIT Press, 1999 (''23rd printing )
  • Informally, an algorithm''''' is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output. An ' algorithm is thus a sequence of computational steps that transform the input into the output.
  • * {{quote-magazine, date=2013-07-26, author=(Leo Hickman)
  • , volume=189, issue=7, page=26, magazine=(The Guardian Weekly) , title= How algorithms rule the world , passage=The use of algorithms in policing is one example of their increasing influence on our lives. And, as their ubiquity spreads, so too does the debate around whether we should allow ourselves to become so reliant on them – and who, if anyone, is policing their use.}}
  • (archaic) Calculation with Arabic numerals; algorism.
  • Hyponyms

    (hyp-top) * approximation algorithm * checksum algorithm * classification algorithm * compression algorithm * computer arithmetic algorithm * distributed algorithm * divide and conquer algorithm (hyp-mid) * genetic algorithm * greedy algorithm * parallel algorithm * randomized algorithm * randomized algorithm * semi-algorithm * sequential algorithm (hyp-bottom)

    Usage notes

    * Though some technical definitions require that an algorithm always terminate in a finite number of steps, this distinction is not generally observed in practice.

    See also

    * data structure * function * program

    maximax

    English

    Noun

    (-)
  • (economics, computer science, decision theory) A strategy or algorithm that seeks to maximize the maximum possible result (that is, that prefers the alternative with the chance of the best possible outcome, even if its expected outcome and its worst possible outcome are worse than other alternatives);
  • * 2009 , Harold Kerzner, Project Management: A Systems Approach to Planning, Scheduling, and Controlling , Tenth Edition, John Wiley and Sons, ISBN 978-0-470-27870-3, page 749:
  • The first criterion is the criterion, often referred to the maximax criterion. the decision-maker is always optimistic and attempts to maximize profits by a go-for-broke strategy.

    See also

    * (strategy that maximizes the maximum) maximin, minimax, minimin