Algorithm (nonfiction): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 5: | Line 5: | ||
<gallery> | <gallery> | ||
File:Ascleplius Myrmidon Halting Problem.jpg|link=On Halting Problems|Asclepius Myrmidon publishes new analysis of unregistered [[On Halting Problems|halting problem algorithms]], predicts emergence of new algorithms for [[crimes against mathematical constants]]. | File:Ascleplius Myrmidon Halting Problem.jpg|link=On Halting Problems|Asclepius Myrmidon publishes new analysis of unregistered [[On Halting Problems|halting problem algorithms]], predicts emergence of new algorithms for [[crimes against mathematical constants]]. | ||
File:Numbered cake pops.jpg|link=Numbered cake algorithm| | File:Numbered cake pops.jpg|link=Numbered cake algorithm|[[Numbered cake algorithm]] used to build new type of [[scrying engine]]. | ||
</gallery> | </gallery> | ||
Revision as of 16:35, 24 January 2017
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" (or true) (more accurately the number b in location B is greater than or equal to the number a in location A) THEN, the algorithm specifies B ← B − A (meaning the number b − a replaces the old b). Similarly, IF A > B, THEN A ← A − B. The process terminates when (the contents of) B is 0, yielding the g.c.d. in A.
In mathematics and Computer science, an algorithm is a self-contained step-by-step set of operations to be performed.
In the News
Asclepius Myrmidon publishes new analysis of unregistered halting problem algorithms, predicts emergence of new algorithms for crimes against mathematical constants.
Numbered cake algorithm used to build new type of scrying engine.
Fiction cross-reference
Nonfiction cross-reference
External links:
- Algorithm @ Wikipedia