Table of Contents
239 relations: Abstract machine, Ada Lovelace, Adelard of Bath, Al-Khwarizmi, Al-Kindi, Alan Turing, ALGOL, Algorism, Algorithm, Algorithm aversion, Algorithm characterizations, Algorithm engineering, Algorithmic bias, Algorithmic composition, Algorithmic efficiency, Algorithmic entities, Algorithmic paradigm, Algorithmic technique, Alonzo Church, Analysis of algorithms, Ancient Egyptian mathematics, Approximation algorithm, Arithmetic, Assembly language, Association for Computing Machinery, Asymptotically optimal algorithm, Automata theory, Automated decision-making, Automated reasoning, Automation, Axiom, Babylonia, Babylonian astronomy, Babylonian mathematics, Backtracking, Baghdad, Baudot code, Benchmark (computing), Big O notation, Binary search, Borůvka's algorithm, Branch and bound, Brāhmasphuṭasiddhānta, Brute-force search, Bureaucracy, C (programming language), Calculation, Calculator, Charles Babbage, Chess, ... Expand index (189 more) »
Abstract machine
In computer science, an abstract machine is a theoretical model that allows for a detailed and precise analysis of how a computer system functions.
See Algorithm and Abstract machine
Ada Lovelace
Augusta Ada King, Countess of Lovelace (née Byron; 10 December 1815 – 27 November 1852), also known as Ada Lovelace, was an English mathematician and writer chiefly known for her work on Charles Babbage's proposed mechanical general-purpose computer, the Analytical Engine.
See Algorithm and Ada Lovelace
Adelard of Bath
Adelard of Bath (Adelardus Bathensis; 1080? 1142–1152?) was a 12th-century English natural philosopher.
See Algorithm and Adelard of Bath
Al-Khwarizmi
Muhammad ibn Musa al-Khwarizmi (محمد بن موسى خوارزمی), often referred to as simply al-Khwarizmi, was a polymath who produced vastly influential Arabic-language works in mathematics, astronomy, and geography.
See Algorithm and Al-Khwarizmi
Al-Kindi
Abū Yūsuf Yaʻqūb ibn ʼIsḥāq aṣ-Ṣabbāḥ al-Kindī (أبو يوسف يعقوب بن إسحاق الصبّاح الكندي; Alkindus) was an Arab Muslim polymath active as a philosopher, mathematician, physician, and music theorist.
Alan Turing
Alan Mathison Turing (23 June 1912 – 7 June 1954) was an English mathematician, computer scientist, logician, cryptanalyst, philosopher and theoretical biologist.
ALGOL
ALGOL (short for "Algorithmic Language") is a family of imperative computer programming languages originally developed in 1958.
Algorism
Algorism is the technique of performing basic arithmetic by writing numbers in place value form and applying a set of memorized rules and facts to the digits. Algorithm and Algorism are algorithms.
Algorithm
In mathematics and computer science, an algorithm is a finite sequence of mathematically rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithm and algorithm are algorithms, mathematical logic and theoretical computer science.
Algorithm aversion
Algorithm aversion is "biased assessment of an algorithm which manifests in negative behaviours and attitudes towards the algorithm compared to a human agent." It describes a phenomenon where humans reject advice from an algorithm in a case where they would accept the same advice if they thought it was coming from another human.
See Algorithm and Algorithm aversion
Algorithm characterizations
Algorithm characterizations are attempts to formalize the word algorithm. Algorithm and algorithm characterizations are algorithms.
See Algorithm and Algorithm characterizations
Algorithm engineering
Algorithm engineering focuses on the design, analysis, implementation, optimization, profiling and experimental evaluation of computer algorithms, bridging the gap between algorithmics theory and practical applications of algorithms in software engineering. Algorithm and algorithm engineering are algorithms and theoretical computer science.
See Algorithm and Algorithm engineering
Algorithmic bias
Algorithmic bias describes systematic and repeatable errors in a computer system that create "unfair" outcomes, such as "privileging" one category over another in ways different from the intended function of the algorithm.
See Algorithm and Algorithmic bias
Algorithmic composition
Algorithmic composition is the technique of using algorithms to create music.
See Algorithm and Algorithmic composition
Algorithmic efficiency
In computer science, algorithmic efficiency is a property of an algorithm which relates to the amount of computational resources used by the algorithm.
See Algorithm and Algorithmic efficiency
Algorithmic entities
Algorithmic entities refer to autonomous algorithms that operate without human control or interference.
See Algorithm and Algorithmic entities
Algorithmic paradigm
An algorithmic paradigm or algorithm design paradigm is a generic model or framework which underlies the design of a class of algorithms. Algorithm and algorithmic paradigm are algorithms.
See Algorithm and Algorithmic paradigm
Algorithmic technique
In mathematics and computer science, an algorithmic technique is a general approach for implementing a process or computation. Algorithm and algorithmic technique are mathematical logic and theoretical computer science.
See Algorithm and Algorithmic technique
Alonzo Church
Alonzo Church (June 14, 1903 – August 11, 1995) was an American mathematician, computer scientist, logician, and philosopher who made major contributions to mathematical logic and the foundations of theoretical computer science.
See Algorithm and Alonzo Church
Analysis of algorithms
In computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms—the amount of time, storage, or other resources needed to execute them.
See Algorithm and Analysis of algorithms
Ancient Egyptian mathematics
Ancient Egyptian mathematics is the mathematics that was developed and used in Ancient Egypt 3000 to c., from the Old Kingdom of Egypt until roughly the beginning of Hellenistic Egypt.
See Algorithm and Ancient Egyptian mathematics
Approximation algorithm
In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned solution to the optimal one.
See Algorithm and Approximation algorithm
Arithmetic
Arithmetic is an elementary branch of mathematics that studies numerical operations like addition, subtraction, multiplication, and division.
Assembly language
In computer programming, assembly language (alternatively assembler language or symbolic machine code), often referred to simply as assembly and commonly abbreviated as ASM or asm, is any low-level programming language with a very strong correspondence between the instructions in the language and the architecture's machine code instructions.
See Algorithm and Assembly language
Association for Computing Machinery
The Association for Computing Machinery (ACM) is a US-based international learned society for computing.
See Algorithm and Association for Computing Machinery
Asymptotically optimal algorithm
In computer science, an algorithm is said to be asymptotically optimal if, roughly speaking, for large inputs it performs at worst a constant factor (independent of the input size) worse than the best possible algorithm.
See Algorithm and Asymptotically optimal algorithm
Automata theory
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them.
See Algorithm and Automata theory
Automated decision-making
Automated decision-making (ADM) involves the use of data, machines and algorithms to make decisions in a range of contexts, including public administration, business, health, education, law, employment, transport, media and entertainment, with varying degrees of human oversight or intervention.
See Algorithm and Automated decision-making
Automated reasoning
In computer science, in particular in knowledge representation and reasoning and metalogic, the area of automated reasoning is dedicated to understanding different aspects of reasoning. Algorithm and automated reasoning are theoretical computer science.
See Algorithm and Automated reasoning
Automation
Automation describes a wide range of technologies that reduce human intervention in processes, mainly by predetermining decision criteria, subprocess relationships, and related actions, as well as embodying those predeterminations in machines.
Axiom
An axiom, postulate, or assumption is a statement that is taken to be true, to serve as a premise or starting point for further reasoning and arguments.
Babylonia
Babylonia (𒆳𒆍𒀭𒊏𒆠) was an ancient Akkadian-speaking state and cultural area based in the city of Babylon in central-southern Mesopotamia (present-day Iraq and parts of Syria and Iran).
Babylonian astronomy
Babylonian astronomy was the study or recording of celestial objects during the early history of Mesopotamia.
See Algorithm and Babylonian astronomy
Babylonian mathematics
Babylonian mathematics (also known as Assyro-Babylonian mathematics) is the mathematics developed or practiced by the people of Mesopotamia, as attested by sources mainly surviving from the Old Babylonian period (1830–1531 BC) to the Seleucid from the last three or four centuries BC.
See Algorithm and Babylonian mathematics
Backtracking
Backtracking is a class of algorithms for finding solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate ("backtracks") as soon as it determines that the candidate cannot possibly be completed to a valid solution.
See Algorithm and Backtracking
Baghdad
Baghdad (or; translit) is the capital of Iraq and the second-largest city in the Arab and in West Asia after Tehran.
Baudot code
The Baudot code is an early character encoding for telegraphy invented by Émile Baudot in the 1870s.
Benchmark (computing)
In computing, a benchmark is the act of running a computer program, a set of programs, or other operations, in order to assess the relative performance of an object, normally by running a number of standard tests and trials against it.
See Algorithm and Benchmark (computing)
Big O notation
Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity.
See Algorithm and Big O notation
Binary search
In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array.
See Algorithm and Binary search
Borůvka's algorithm
Borůvka's algorithm is a greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected.
See Algorithm and Borůvka's algorithm
Branch and bound
Branch and bound (BB, B&B, or BnB) is a method for solving optimization problems by breaking them down into smaller sub-problems and using a bounding function to eliminate sub-problems that cannot contain the optimal solution.
See Algorithm and Branch and bound
Brāhmasphuṭasiddhānta
The Brāhma-sphuṭa-siddhānta ("Correctly Established Doctrine of Brahma", abbreviated BSS) is a main work of Brahmagupta, written c. 628.
See Algorithm and Brāhmasphuṭasiddhānta
Brute-force search
In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically checking all possible candidates for whether or not each candidate satisfies the problem's statement.
See Algorithm and Brute-force search
Bureaucracy
Bureaucracy is a system of organization where decisions are made by a body of non-elected officials.
C (programming language)
C (pronounced – like the letter c) is a general-purpose programming language.
See Algorithm and C (programming language)
Calculation
A calculation is a deliberate mathematical process that transforms one or more inputs into one or more outputs or results.
Calculator
An electronic calculator is typically a portable electronic device used to perform calculations, ranging from basic arithmetic to complex mathematics.
Charles Babbage
Charles Babbage (26 December 1791 – 18 October 1871) was an English polymath.
See Algorithm and Charles Babbage
Chess
Chess is a board game for two players.
Church–Turing thesis
In computability theory, the Church–Turing thesis (also known as computability thesis, the Turing–Church thesis, the Church–Turing conjecture, Church's thesis, Church's conjecture, and Turing's thesis) is a thesis about the nature of computable functions.
See Algorithm and Church–Turing thesis
Claude Shannon
Claude Elwood Shannon (April 30, 1916 – February 24, 2001) was an American mathematician, electrical engineer, computer scientist and cryptographer known as the "father of information theory" and as the "father of the Information Age".
See Algorithm and Claude Shannon
Communications of the ACM
Communications of the ACM is the monthly journal of the Association for Computing Machinery (ACM).
See Algorithm and Communications of the ACM
Computability theory
Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. Algorithm and Computability theory are mathematical logic.
See Algorithm and Computability theory
Computation
A computation is any type of arithmetic or non-arithmetic calculation that is well-defined. Algorithm and computation are theoretical computer science.
Computational complexity theory
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other.
See Algorithm and Computational complexity theory
Computational mathematics
Computational mathematics is the study of the interaction between mathematics and calculations done by a computer.
See Algorithm and Computational mathematics
Computational problem
In theoretical computer science, a computational problem is one that asks for a solution in terms of an algorithm. Algorithm and computational problem are theoretical computer science.
See Algorithm and Computational problem
Computational topology
Algorithmic topology, or computational topology, is a subfield of topology with an overlap with areas of computer science, in particular, computational geometry and computational complexity theory.
See Algorithm and Computational topology
Computer program
A computer program is a sequence or set of instructions in a programming language for a computer to execute.
See Algorithm and Computer program
Computer science
Computer science is the study of computation, information, and automation.
See Algorithm and Computer science
Conditional (computer programming)
In computer science, conditionals (that is, conditional statements, conditional expressions and conditional constructs) are programming language constructs that perform different computations or actions or return different values depending on the value of a Boolean expression, called a condition.
See Algorithm and Conditional (computer programming)
Control flow
In computer science, control flow (or flow of control) is the order in which individual statements, instructions or function calls of an imperative program are executed or evaluated.
See Algorithm and Control flow
Control table
Control tables are tables that control the control flow or play a major part in program control.
See Algorithm and Control table
Convex polytope
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean space \mathbb^n.
See Algorithm and Convex polytope
Cookbook
A cookbook or cookery book is a kitchen reference containing recipes.
Correctness (computer science)
In theoretical computer science, an algorithm is correct with respect to a specification if it behaves as specified. Algorithm and Correctness (computer science) are theoretical computer science.
See Algorithm and Correctness (computer science)
Cristopher Moore
Cristopher David Moore, known as Cris Moore, (born March 12, 1968, in New Brunswick, New Jersey), retrieved 2023-05-31.
See Algorithm and Cristopher Moore
Cryptanalysis
Cryptanalysis (from the Greek kryptós, "hidden", and analýein, "to analyze") refers to the process of analyzing information systems in order to understand hidden aspects of the systems.
See Algorithm and Cryptanalysis
Data compression
In information theory, data compression, source coding, or bit-rate reduction is the process of encoding information using fewer bits than the original representation.
See Algorithm and Data compression
Data processing
Data processing is the collection and manipulation of digital data to produce meaningful information.
See Algorithm and Data processing
David Hilbert
David Hilbert (23 January 1862 – 14 February 1943) was a German mathematician and one of the most influential mathematicians of his time.
See Algorithm and David Hilbert
Decidability (logic)
In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer.
See Algorithm and Decidability (logic)
Determinism
Determinism is the philosophical view that all events in the universe, including human decisions and actions, are causally inevitable.
Deterministic algorithm
In computer science, a deterministic algorithm is an algorithm that, given a particular input, will always produce the same output, with the underlying machine always passing through the same sequence of states.
See Algorithm and Deterministic algorithm
Diamond v. Diehr
Diamond v. Diehr, 450 U.S. 175 (1981), was a United States Supreme Court decision which held that controlling the execution of a physical process, by running a computer program did not preclude patentability of the invention as a whole.
See Algorithm and Diamond v. Diehr
Difference engine
A difference engine is an automatic mechanical calculator designed to tabulate polynomial functions.
See Algorithm and Difference engine
Distributed algorithm
A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors.
See Algorithm and Distributed algorithm
Divide-and-conquer algorithm
In computer science, divide and conquer is an algorithm design paradigm. Algorithm and divide-and-conquer algorithm are algorithms.
See Algorithm and Divide-and-conquer algorithm
Division algorithm
A division algorithm is an algorithm which, given two integers N and D (respectively the numerator and the denominator), computes their quotient and/or remainder, the result of Euclidean division.
See Algorithm and Division algorithm
Donald Knuth
Donald Ervin Knuth (born January 10, 1938) is an American computer scientist and mathematician.
See Algorithm and Donald Knuth
DRAKON
DRAKON is a free and open source algorithmic visual programming and modeling language developed as part of the defunct Soviet Union Buran space program in 1986 following the need in increase of software development productivity.
Dynamic programming
Dynamic programming is both a mathematical optimization method and an algorithmic paradigm.
See Algorithm and Dynamic programming
Effective method
In logic, mathematics and computer science, especially metalogic and computability theory, an effective methodHunter, Geoffrey, Metalogic: An Introduction to the Metatheory of Standard First-Order Logic, University of California Press, 1971 or effective procedure is a procedure for solving a problem by any intuitively 'effective' means from a specific class.
See Algorithm and Effective method
Electrical network
An electrical network is an interconnection of electrical components (e.g., batteries, resistors, inductors, capacitors, switches, transistors) or a model of such an interconnection, consisting of electrical elements (e.g., voltage sources, current sources, resistances, inductances, capacitances).
See Algorithm and Electrical network
Emil Leon Post
Emil Leon Post (February 11, 1897 – April 21, 1954) was an American mathematician and logician.
See Algorithm and Emil Leon Post
Empty string
In formal language theory, the empty string, or empty word, is the unique string of length zero.
See Algorithm and Empty string
Entscheidungsproblem
In mathematics and computer science, the paren) is a challenge posed by David Hilbert and Wilhelm Ackermann in 1928. It asks for an algorithm that considers an inputted statement and answers "yes" or "no" according to whether it is universally valid, i.e., valid in every structure. Algorithm and Entscheidungsproblem are mathematical logic.
See Algorithm and Entscheidungsproblem
Euclid's Elements
The Elements (Στοιχεῖα) is a mathematical treatise consisting of 13 books attributed to the ancient Greek mathematician Euclid 300 BC.
See Algorithm and Euclid's Elements
Euclidean algorithm
. EXAMPLES CAN BE FOUND BELOW, E.G., IN THE "Matrix method" SECTION.
See Algorithm and Euclidean algorithm
Execution (computing)
Execution in computer and software engineering is the process by which a computer or virtual machine interprets and acts on the instructions of a computer program.
See Algorithm and Execution (computing)
Export of cryptography
The export of cryptography is the transfer from one country to another of devices and technology related to cryptography.
See Algorithm and Export of cryptography
Fast Fourier transform
A fast Fourier transform (FFT) is an algorithm that computes the Discrete Fourier Transform (DFT) of a sequence, or its inverse (IDFT).
See Algorithm and Fast Fourier transform
Feedback
Feedback occurs when outputs of a system are routed back as inputs as part of a chain of cause-and-effect that forms a circuit or loop.
Finite-state machine
A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation.
See Algorithm and Finite-state machine
Flowchart
A flowchart is a type of diagram that represents a workflow or process.
Floyd–Warshall algorithm
In computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, the Roy–Warshall algorithm, the Roy–Floyd algorithm, or the WFI algorithm) is an algorithm for finding shortest paths in a directed weighted graph with positive or negative edge weights (but with no negative cycles).
See Algorithm and Floyd–Warshall algorithm
Formal language
In logic, mathematics, computer science, and linguistics, a formal language consists of words whose letters are taken from an alphabet and are well-formed according to a specific set of rules called a formal grammar. Algorithm and formal language are theoretical computer science.
See Algorithm and Formal language
Formal system
A formal system is an abstract structure and formalization of an axiomatic system used for inferring theorems from axioms by a set of inference rules.
See Algorithm and Formal system
Frequency analysis
In cryptanalysis, frequency analysis (also known as counting letters) is the study of the frequency of letters or groups of letters in a ciphertext.
See Algorithm and Frequency analysis
Function (mathematics)
In mathematics, a function from a set to a set assigns to each element of exactly one element of.
See Algorithm and Function (mathematics)
Functional programming
In computer science, functional programming is a programming paradigm where programs are constructed by applying and composing functions.
See Algorithm and Functional programming
Garbage in, garbage out
In computer science, garbage in, garbage out (GIGO) is the concept that flawed, biased or poor quality ("garbage") information or input produces a result or output of similar ("garbage") quality.
See Algorithm and Garbage in, garbage out
Genetic algorithm
In computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA).
See Algorithm and Genetic algorithm
Geoffrey Chaucer
Geoffrey Chaucer (– 25 October 1400) was an English poet, author, and civil servant best known for The Canterbury Tales.
See Algorithm and Geoffrey Chaucer
Georg Cantor
Georg Ferdinand Ludwig Philipp Cantor (– 6 January 1918) was a mathematician who played a pivotal role in the creation of set theory, which has become a fundamental theory in mathematics.
See Algorithm and Georg Cantor
George Boole
George Boole Jnr (2 November 1815 – 8 December 1864) was a largely self-taught English mathematician, philosopher, and logician, most of whose short career was spent as the first professor of mathematics at Queen's College, Cork in Ireland.
See Algorithm and George Boole
George Dantzig
George Bernard Dantzig (November 8, 1914 – May 13, 2005) was an American mathematical scientist who made contributions to industrial engineering, operations research, computer science, economics, and statistics.
See Algorithm and George Dantzig
George Stibitz
George Robert Stibitz (April 30, 1904 – January 31, 1995) was an American researcher at Bell Labs who is internationally recognized as one of the fathers of the modern digital computer.
See Algorithm and George Stibitz
Gottfried Wilhelm Leibniz
Gottfried Wilhelm Leibniz (– 14 November 1716) was a German polymath active as a mathematician, philosopher, scientist and diplomat who invented calculus in addition to many other branches of mathematics, such as binary arithmetic, and statistics.
See Algorithm and Gottfried Wilhelm Leibniz
Gottlob Frege
Friedrich Ludwig Gottlob Frege (8 November 1848 – 26 July 1925) was a German philosopher, logician, and mathematician.
See Algorithm and Gottlob Frege
Gottschalk v. Benson
Gottschalk v. Benson, 409 U.S. 63 (1972), was a United States Supreme Court case in which the Court ruled that a process claim directed to a numerical algorithm, as such, was not patentable because "the patent would wholly pre-empt the mathematical formula and in practical effect would be a patent on the algorithm itself." That would be tantamount to allowing a patent on an abstract idea, contrary to precedent dating back to the middle of the 19th century.
See Algorithm and Gottschalk v. Benson
Government by algorithm
Government by algorithm (also known as algorithmic regulation, regulation by algorithms, algorithmic governance, algocratic governance, algorithmic legal order or algocracy) is an alternative form of government or social ordering where the usage of computer algorithms is applied to regulations, law enforcement, and generally any aspect of everyday life such as transportation or land registration. Algorithm and government by algorithm are algorithms.
See Algorithm and Government by algorithm
Graph (discrete mathematics)
In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some sense "related".
See Algorithm and Graph (discrete mathematics)
Graph theory
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. Algorithm and graph theory are theoretical computer science.
See Algorithm and Graph theory
Graph traversal
In computer science, graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph.
See Algorithm and Graph traversal
Greedy algorithm
A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage.
See Algorithm and Greedy algorithm
Greek mathematics
Greek mathematics refers to mathematics texts and ideas stemming from the Archaic through the Hellenistic and Roman periods, mostly from the 5th century BC to the 6th century AD, around the shores of the Mediterranean.
See Algorithm and Greek mathematics
Greenwood Publishing Group
Greenwood Publishing Group, Inc. (GPG), also known as ABC-Clio/Greenwood (stylized ABC-CLIO/Greenwood), is an educational and academic publisher (middle school through university level) which is today part of ABC-Clio.
See Algorithm and Greenwood Publishing Group
Heuristic
A heuristic or heuristic technique (problem solving, mental shortcut, rule of thumb) is any approach to problem solving that employs a pragmatic method that is not fully optimized, perfected, or rationalized, but is nevertheless "good enough" as an approximation or attribute substitution.
Heuristic (computer science)
In mathematical optimization and computer science, heuristic (from Greek εὑρίσκω "I find, discover") is a technique designed for problem solving more quickly when classic methods are too slow for finding an exact or approximate solution, or when classic methods fail to find any exact solution in a search space.
See Algorithm and Heuristic (computer science)
High-level synthesis
High-level synthesis (HLS), sometimes referred to as C synthesis, electronic system-level (ESL) synthesis, algorithmic synthesis, or behavioral synthesis, is an automated design process that takes an abstract behavioral specification of a digital system and finds a register-transfer level structure that realizes the given behavior.
See Algorithm and High-level synthesis
Hindu–Arabic numeral system
The Hindu–Arabic numeral system (also known as the Indo-Arabic numeral system,Audun Holme,, 2000 Hindu numeral system, Arabic numeral system) is a positional base ten numeral system for representing integers; its extension to non-integers is the decimal numeral system, which is presently the most common numeral system.
See Algorithm and Hindu–Arabic numeral system
Howard H. Aiken
Howard Hathaway Aiken (March 8, 1900 – March 14, 1973) was an American physicist and a pioneer in computing.
See Algorithm and Howard H. Aiken
Huffman coding
In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression.
See Algorithm and Huffman coding
Human brain
The brain is the central organ of the human nervous system, and with the spinal cord makes up the central nervous system.
Implementation
Implementation is the realization of an application, execution of a plan, idea, model, design, specification, standard, algorithm, policy, or the administration or management of a process or objective.
See Algorithm and Implementation
Indian mathematics
Indian mathematics emerged in the Indian subcontinent from 1200 BCE until the end of the 18th century.
See Algorithm and Indian mathematics
Inference
Inferences are steps in reasoning, moving from premises to logical consequences; etymologically, the word infer means to "carry forward".
Integer
An integer is the number zero (0), a positive natural number (1, 2, 3,...), or the negation of a positive natural number (−1, −2, −3,...). The negations or additive inverses of the positive natural numbers are referred to as negative integers.
Integer programming
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers.
See Algorithm and Integer programming
Interpreter (computing)
In computer science, an interpreter is a computer program that directly executes instructions written in a programming or scripting language, without requiring them previously to have been compiled into a machine language program.
See Algorithm and Interpreter (computing)
Introduction to Algorithms
Introduction to Algorithms is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
See Algorithm and Introduction to Algorithms
Iteration
Iteration is the repetition of a process in order to generate a (possibly unbounded) sequence of outcomes. Algorithm and Iteration are algorithms.
J. Barkley Rosser
John Barkley Rosser Sr. (December 6, 1907 – September 5, 1989) was an American logician, a student of Alonzo Church, and known for his part in the Church–Rosser theorem in lambda calculus.
See Algorithm and J. Barkley Rosser
Jacquard machine
The Jacquard machine is a device fitted to a loom that simplifies the process of manufacturing textiles with such complex patterns as brocade, damask and matelassé.
See Algorithm and Jacquard machine
Jacques Herbrand
Jacques Herbrand (12 February 1908 – 27 July 1931) was a French mathematician.
See Algorithm and Jacques Herbrand
John G. Kemeny
John George Kemeny (born Kemény János György; May 31, 1926 – December 26, 1992) was a Hungarian-born American mathematician, computer scientist, and educator best known for co-developing the BASIC programming language in 1964 with Thomas E. Kurtz.
See Algorithm and John G. Kemeny
John of Seville
John of Seville (Latin: Johannes Hispalensis or Johannes Hispaniensis) (fl. 1133-53) was one of the main translators from Arabic into Castilian in partnership with Dominicus Gundissalinus during the early days of the Toledo School of Translators.
See Algorithm and John of Seville
John von Neumann
John von Neumann (Neumann János Lajos; December 28, 1903 – February 8, 1957) was a Hungarian and American mathematician, physicist, computer scientist, engineer and polymath.
See Algorithm and John von Neumann
Joseph Marie Jacquard
Joseph Marie Charles dit (called or nicknamed) Jacquard (7 July 1752 – 7 August 1834) was a French weaver and merchant.
See Algorithm and Joseph Marie Jacquard
Kerala school of astronomy and mathematics
The Kerala school of astronomy and mathematics or the Kerala school was a school of mathematics and astronomy founded by Madhava of Sangamagrama in Tirur, Malappuram, Kerala, India, which included among its members: Parameshvara, Neelakanta Somayaji, Jyeshtadeva, Achyuta Pisharati, Melpathur Narayana Bhattathiri and Achyuta Panikkar.
See Algorithm and Kerala school of astronomy and mathematics
Knapsack problem
The knapsack problem is the following problem in combinatorial optimization: It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
See Algorithm and Knapsack problem
Kruskal's algorithm
Kruskal's algorithm finds a minimum spanning forest of an undirected edge-weighted graph.
See Algorithm and Kruskal's algorithm
Kurt Gödel
Kurt Friedrich Gödel (April 28, 1906 – January 14, 1978) was a logician, mathematician, and philosopher.
Lambda calculus
Lambda calculus (also written as λ-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. Algorithm and Lambda calculus are theoretical computer science.
See Algorithm and Lambda calculus
Las Vegas algorithm
In computing, a Las Vegas algorithm is a randomized algorithm that always gives correct results; that is, it always produces the correct result or it informs about the failure.
See Algorithm and Las Vegas algorithm
Latinisation of names
Latinisation (or Latinization) of names, also known as onomastic Latinisation, is the practice of rendering a non-Latin name in a modern Latin style.
See Algorithm and Latinisation of names
Linear programming
Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements and objective are represented by linear relationships.
See Algorithm and Linear programming
List of algorithm general topics
This is a list of algorithm general topics. Algorithm and list of algorithm general topics are algorithms.
See Algorithm and List of algorithm general topics
List of algorithms
An algorithm is fundamentally a set of rules or defined procedures that is typically designed and used to solve a specific problem or a broad set of problems. Algorithm and List of algorithms are algorithms.
See Algorithm and List of algorithms
Local search (optimization)
In computer science, local search is a heuristic method for solving computationally hard optimization problems.
See Algorithm and Local search (optimization)
Logic
Logic is the study of correct reasoning.
London Mathematical Society
The London Mathematical Society (LMS) is one of the United Kingdom's learned societies for mathematics (the others being the Royal Statistical Society (RSS), the Institute of Mathematics and its Applications (IMA), the Edinburgh Mathematical Society and the Operational Research Society (ORS).
See Algorithm and London Mathematical Society
Lookup table
In computer science, a lookup table (LUT) is an array that replaces runtime computation with a simpler array indexing operation, in a process termed as direct addressing.
See Algorithm and Lookup table
Machine code
In computer programming, machine code is computer code consisting of machine language instructions, which are used to control a computer's central processing unit (CPU).
See Algorithm and Machine code
Martin Davis (mathematician)
Martin David Davis (March 8, 1928 – January 1, 2023) was an American mathematician and computer scientist who contributed to the fields of computability theory and mathematical logic.
See Algorithm and Martin Davis (mathematician)
Mathematical induction
Mathematical induction is a method for proving that a statement P(n) is true for every natural number n, that is, that the infinitely many cases P(0), P(1), P(2), P(3), \dots  all hold.
See Algorithm and Mathematical induction
Mathematical table
Mathematical tables are lists of numbers showing the results of a calculation with varying arguments.
See Algorithm and Mathematical table
Mathematics
Mathematics is a field of study that discovers and organizes abstract objects, methods, theories and theorems that are developed and proved for the needs of empirical sciences and mathematics itself.
Mathematics in the medieval Islamic world
Mathematics during the Golden Age of Islam, especially during the 9th and 10th centuries, was built upon syntheses of Greek mathematics (Euclid, Archimedes, Apollonius) and Indian mathematics (Aryabhata, Brahmagupta).
See Algorithm and Mathematics in the medieval Islamic world
Maximum and minimum
In mathematical analysis, the maximum and minimum of a function are, respectively, the largest and smallest value taken by the function.
See Algorithm and Maximum and minimum
Maximum flow problem
In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate.
See Algorithm and Maximum flow problem
Memoization
In computing, memoization or memoisation is an optimization technique used primarily to speed up computer programs by storing the results of expensive function calls to pure functions and returning the cached result when the same inputs occur again.
Merge sort
In computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm.
Mesopotamia
Mesopotamia is a historical region of West Asia situated within the Tigris–Euphrates river system, in the northern part of the Fertile Crescent.
Monte Carlo algorithm
In computing, a Monte Carlo algorithm is a randomized algorithm whose output may be incorrect with a certain (typically small) probability.
See Algorithm and Monte Carlo algorithm
National Institute of Standards and Technology
The National Institute of Standards and Technology (NIST) is an agency of the United States Department of Commerce whose mission is to promote American innovation and industrial competitiveness.
See Algorithm and National Institute of Standards and Technology
Natural language
In neuropsychology, linguistics, and philosophy of language, a natural language or ordinary language is any language that occurs naturally in a human community by a process of use, repetition, and change without conscious planning or premeditation.
See Algorithm and Natural language
Neural network (biology)
A neural network, also called a neuronal network, is an interconnected population of neurons (typically containing multiple neural circuits).
See Algorithm and Neural network (biology)
Nicomachus
Nicomachus of Gerasa (Νικόμαχος) was an Ancient Greek Neopythagorean philosopher from Gerasa, in the Roman province of Syria (now Jerash, Jordan).
Nondeterministic algorithm
In computer science and computer programming, a nondeterministic algorithm is an algorithm that, even for the same input, can exhibit different behaviors on different runs, as opposed to a deterministic algorithm.
See Algorithm and Nondeterministic algorithm
Old Babylonian Empire
The Old Babylonian Empire, or First Babylonian Empire, is dated to, and comes after the end of Sumerian power with the destruction of the Third Dynasty of Ur, and the subsequent Isin-Larsa period.
See Algorithm and Old Babylonian Empire
Operations research
Operations research (operational research) (U.S. Air Force Specialty Code: Operations Analysis), often shortened to the initialism OR, is a discipline that deals with the development and application of analytical methods to improve decision-making.
See Algorithm and Operations research
Optimization problem
In mathematics, engineering, computer science and economics, an optimization problem is the problem of finding the best solution from all feasible solutions.
See Algorithm and Optimization problem
Overlapping subproblems
In computer science, a problem is said to have overlapping subproblems if the problem can be broken down into subproblems which are reused several times or a recursive algorithm for the problem solves the same subproblem over and over rather than always generating new subproblems.
See Algorithm and Overlapping subproblems
P (complexity)
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class.
See Algorithm and P (complexity)
P versus NP problem
The P versus NP problem is a major unsolved problem in theoretical computer science.
See Algorithm and P versus NP problem
Parallel algorithm
In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is an algorithm which can do multiple operations in a given time.
See Algorithm and Parallel algorithm
Pidgin code
In computer programming, pidgin code is a mixture of several programming languages in the same program, or pseudocode that is a mixture of a programming language with natural language descriptions.
Piotr Indyk
Piotr Indyk is Thomas D. and Virginia W. Cabot Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology.
Post–Turing machine
A Post–Turing machine is a "program formulation" of a type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model of computation.
See Algorithm and Post–Turing machine
Prim's algorithm
In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.
See Algorithm and Prim's algorithm
Programming language
A programming language is a system of notation for writing computer programs.
See Algorithm and Programming language
Pseudocode
In computer science, pseudocode is a description of the steps in an algorithm using a mix of conventions of programming languages (like assignment operator, conditional operator, loop) with informal, usually self-explanatory, notation of actions and conditions.
Punched card
A punched card (also punch card or punched-card) is a piece of card stock that stores digital data using punched holes.
See Algorithm and Punched card
Quantity
Quantity or amount is a property that can exist as a multitude or magnitude, which illustrate discontinuity and continuity.
Quantum algorithm
In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. Algorithm and quantum algorithm are theoretical computer science.
See Algorithm and Quantum algorithm
Quantum computing
A quantum computer is a computer that exploits quantum mechanical phenomena. Algorithm and quantum computing are theoretical computer science.
See Algorithm and Quantum computing
Quantum entanglement
Quantum entanglement is the phenomenon of a group of particles being generated, interacting, or sharing spatial proximity in such a way that the quantum state of each particle of the group cannot be described independently of the state of the others, including when the particles are separated by a large distance.
See Algorithm and Quantum entanglement
Quantum superposition
Quantum superposition is a fundamental principle of quantum mechanics that states that linear combinations of solutions to the Schrödinger equation are also solutions of the Schrödinger equation.
See Algorithm and Quantum superposition
Randomized algorithm
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure.
See Algorithm and Randomized algorithm
Randomness
In common usage, randomness is the apparent or actual lack of definite pattern or predictability in information.
Recipe
A recipe is a set of instructions that describes how to prepare or make something, especially a dish of prepared food.
Recommender system
A recommender system, or a recommendation system (sometimes replacing system with terms such as platform, engine, or algorithm), is a subclass of information filtering system that provides suggestions for items that are most pertinent to a particular user.
See Algorithm and Recommender system
Recursion
Recursion occurs when the definition of a concept or process depends on a simpler or previous version of itself. Algorithm and Recursion are algorithms and mathematical logic.
Recursion (computer science)
In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same problem. Algorithm and recursion (computer science) are theoretical computer science.
See Algorithm and Recursion (computer science)
Reduction (complexity)
In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem. Algorithm and reduction (complexity) are algorithms.
See Algorithm and Reduction (complexity)
Regulation of algorithms
Regulation of algorithms, or algorithmic regulation, is the creation of laws, rules and public sector policies for promotion and regulation of algorithms, particularly in artificial intelligence and machine learning. Algorithm and regulation of algorithms are algorithms.
See Algorithm and Regulation of algorithms
Relay
A relay Electromechanical relay schematic showing a control coil, four pairs of normally open and one pair of normally closed contacts An automotive-style miniature relay with the dust cover taken off A relay is an electrically operated switch.
Rhind Mathematical Papyrus
The Rhind Mathematical Papyrus (RMP; also designated as papyrus British Museum 10057, pBM 10058, and Brooklyn Museum 37.1784Ea-b) is one of the best known examples of ancient Egyptian mathematics.
See Algorithm and Rhind Mathematical Papyrus
RP (complexity)
In computational complexity theory, randomized polynomial time (RP) is the complexity class of problems for which a probabilistic Turing machine exists with these properties.
See Algorithm and RP (complexity)
Search algorithm
In computer science, a search algorithm is an algorithm designed to solve a search problem.
See Algorithm and Search algorithm
Selection algorithm
In computer science, a selection algorithm is an algorithm for finding the kth smallest value in a collection of ordered values, such as numbers.
See Algorithm and Selection algorithm
Shulba Sutras
The Shulva Sutras or Śulbasūtras (Sanskrit: शुल्बसूत्र;: "string, cord, rope") are sutra texts belonging to the Śrauta ritual and containing geometry related to fire-altar construction.
See Algorithm and Shulba Sutras
Shuruppak
Shuruppak (𒋢𒆳𒊒𒆠, SU.KUR.RUki, "the healing place"), modern Tell Fara, was an ancient Sumerian city situated about 55 kilometres (35 mi) south of Nippur and 30 kilometers north of ancient Uruk on the banks of the Euphrates in Iraq's Al-Qādisiyyah Governorate.
Sieve of Eratosthenes
In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. Algorithm and sieve of Eratosthenes are algorithms.
See Algorithm and Sieve of Eratosthenes
Simon & Schuster
Simon & Schuster LLC is an American publishing company owned by Kohlberg Kravis Roberts.
See Algorithm and Simon & Schuster
Simplex algorithm
In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is a popular algorithm for linear programming.
See Algorithm and Simplex algorithm
Simulated annealing
Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function.
See Algorithm and Simulated annealing
Software patent debate
The software patent debate is the argument about the extent to which, as a matter of public policy, it should be possible to patent software and computer-implemented inventions.
See Algorithm and Software patent debate
Spaghetti code
Spaghetti code is a pejorative phrase for difficult-to-maintain and unstructured source code.
See Algorithm and Spaghetti code
Stack (abstract data type)
In computer science, a stack is an abstract data type that serves as a collection of elements with two main operations.
See Algorithm and Stack (abstract data type)
Stanford University
Stanford University (officially Leland Stanford Junior University) is a private research university in Stanford, California.
See Algorithm and Stanford University
State diagram
A state diagram is used in computer science and related fields to describe the behavior of systems.
See Algorithm and State diagram
State-transition table
In automata theory and sequential logic, a state-transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite-state machine will move to, based on the current state and other inputs.
See Algorithm and State-transition table
Stephen Cole Kleene
Stephen Cole Kleene (January 5, 1909 – January 25, 1994) was an American mathematician.
See Algorithm and Stephen Cole Kleene
Stony Brook University
Stony Brook University (SBU), officially the State University of New York at Stony Brook, is a public research university on Long Island in Stony Brook, New York.
See Algorithm and Stony Brook University
Structured program theorem
The structured program theorem, also called the Böhm–Jacopini theorem, is a result in programming language theory.
See Algorithm and Structured program theorem
Sumer
Sumer is the earliest known civilization, located in the historical region of southern Mesopotamia (now south-central Iraq), emerging during the Chalcolithic and early Bronze Ages between the sixth and fifth millennium BC.
Synthetic rubber
A synthetic rubber is an artificial elastomer.
See Algorithm and Synthetic rubber
Tabu search
Tabu search (TS) is a metaheuristic search method employing local search methods used for mathematical optimization.
Telegraphy
Telegraphy is the long-distance transmission of messages where the sender uses symbolic codes, known to the recipient, rather than a physical exchange of an object bearing the message.
Teleprinter
A teleprinter (teletypewriter, teletype or TTY) is an electromechanical device that can be used to send and receive typed messages through various communications channels, in both point-to-point and point-to-multipoint configurations.
The Wall Street Journal
The Wall Street Journal (WSJ), also referred to simply as the Journal, is an American newspaper based in New York City, with a focus on business and finance.
See Algorithm and The Wall Street Journal
Theory of computation
In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently they can be solved or to what degree (e.g., approximate solutions versus precise ones). Algorithm and theory of computation are theoretical computer science.
See Algorithm and Theory of computation
Thomas E. Kurtz
Thomas Eugene Kurtz (born February 22, 1928) is a retired Dartmouth professor of mathematics and computer scientist, who along with his colleague John G. Kemeny set in motion the then revolutionary concept of making computers as freely available to college students as library books were, by implementing the concept of time-sharing at Dartmouth College.
See Algorithm and Thomas E. Kurtz
Ticker tape
Ticker tape was the earliest electrical dedicated financial communications medium, transmitting stock price information over telegraph lines, in use from around 1870 to 1970.
Time complexity
In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm.
See Algorithm and Time complexity
Tower of Hanoi
The Tower of Hanoi (also called The problem of Benares Temple or Tower of Brahma or Lucas' Tower and sometimes pluralized as Towers, or simply pyramid puzzle) is a mathematical game or puzzle consisting of three rods and a number of disks of various diameters, which can slide onto any rod.
See Algorithm and Tower of Hanoi
Turing completeness
In computability theory, a system of data-manipulation rules (such as a model of computation, a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine (devised by English mathematician and computer scientist Alan Turing).
See Algorithm and Turing completeness
Turing machine
A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Algorithm and Turing machine are theoretical computer science.
See Algorithm and Turing machine
Unisys
Unisys Corporation is an American multinational information technology (IT) services and consulting company founded in 1986 and headquartered in Blue Bell, Pennsylvania.
United States Patent and Trademark Office
The United States Patent and Trademark Office (USPTO) is an agency in the U.S. Department of Commerce that serves as the national patent office and trademark registration authority for the United States.
See Algorithm and United States Patent and Trademark Office
Verge escapement
The verge (or crown wheel) escapement is the earliest known type of mechanical escapement, the mechanism in a mechanical clock that controls its rate by allowing the gear train to advance at regular intervals or 'ticks'.
See Algorithm and Verge escapement
Volume
Volume is a measure of regions in three-dimensional space.
Yuri Gurevich
Yuri Gurevich, Professor Emeritus at the University of Michigan, is an American computer scientist and mathematician and the inventor of abstract state machines.
See Algorithm and Yuri Gurevich
ZPP (complexity)
In complexity theory, ZPP (zero-error probabilistic polynomial time) is the complexity class of problems for which a probabilistic Turing machine exists with these properties.
See Algorithm and ZPP (complexity)
0
0 (zero) is a number representing an empty quantity.
See Algorithm and 0
References
Also known as Algorhthym, Algorhythms, Algorithem, Algorithim, Algorithm classification, Algorithm design, Algorithm segment, Algorithmic method, Algorithmic problem, Algorithmically, Algorithmics, Algorithms, Algorithmus, Algoritmi De Numero Indorum, Algorthym, Algorythm, Computational algorithms, Computer algorithm, Computer algorithms, Continuous algorithm, Encoding Algorithm, Formalization of algorithms, History of algorithms, Mathematical algorithm, Naïve algorithm, Optimization algorithms, Patented algorithms, Properties of algorithms, Rule set, Software logic, Software-based, Алгоритм.
, Church–Turing thesis, Claude Shannon, Communications of the ACM, Computability theory, Computation, Computational complexity theory, Computational mathematics, Computational problem, Computational topology, Computer program, Computer science, Conditional (computer programming), Control flow, Control table, Convex polytope, Cookbook, Correctness (computer science), Cristopher Moore, Cryptanalysis, Data compression, Data processing, David Hilbert, Decidability (logic), Determinism, Deterministic algorithm, Diamond v. Diehr, Difference engine, Distributed algorithm, Divide-and-conquer algorithm, Division algorithm, Donald Knuth, DRAKON, Dynamic programming, Effective method, Electrical network, Emil Leon Post, Empty string, Entscheidungsproblem, Euclid's Elements, Euclidean algorithm, Execution (computing), Export of cryptography, Fast Fourier transform, Feedback, Finite-state machine, Flowchart, Floyd–Warshall algorithm, Formal language, Formal system, Frequency analysis, Function (mathematics), Functional programming, Garbage in, garbage out, Genetic algorithm, Geoffrey Chaucer, Georg Cantor, George Boole, George Dantzig, George Stibitz, Gottfried Wilhelm Leibniz, Gottlob Frege, Gottschalk v. Benson, Government by algorithm, Graph (discrete mathematics), Graph theory, Graph traversal, Greedy algorithm, Greek mathematics, Greenwood Publishing Group, Heuristic, Heuristic (computer science), High-level synthesis, Hindu–Arabic numeral system, Howard H. Aiken, Huffman coding, Human brain, Implementation, Indian mathematics, Inference, Integer, Integer programming, Interpreter (computing), Introduction to Algorithms, Iteration, J. Barkley Rosser, Jacquard machine, Jacques Herbrand, John G. Kemeny, John of Seville, John von Neumann, Joseph Marie Jacquard, Kerala school of astronomy and mathematics, Knapsack problem, Kruskal's algorithm, Kurt Gödel, Lambda calculus, Las Vegas algorithm, Latinisation of names, Linear programming, List of algorithm general topics, List of algorithms, Local search (optimization), Logic, London Mathematical Society, Lookup table, Machine code, Martin Davis (mathematician), Mathematical induction, Mathematical table, Mathematics, Mathematics in the medieval Islamic world, Maximum and minimum, Maximum flow problem, Memoization, Merge sort, Mesopotamia, Monte Carlo algorithm, National Institute of Standards and Technology, Natural language, Neural network (biology), Nicomachus, Nondeterministic algorithm, Old Babylonian Empire, Operations research, Optimization problem, Overlapping subproblems, P (complexity), P versus NP problem, Parallel algorithm, Pidgin code, Piotr Indyk, Post–Turing machine, Prim's algorithm, Programming language, Pseudocode, Punched card, Quantity, Quantum algorithm, Quantum computing, Quantum entanglement, Quantum superposition, Randomized algorithm, Randomness, Recipe, Recommender system, Recursion, Recursion (computer science), Reduction (complexity), Regulation of algorithms, Relay, Rhind Mathematical Papyrus, RP (complexity), Search algorithm, Selection algorithm, Shulba Sutras, Shuruppak, Sieve of Eratosthenes, Simon & Schuster, Simplex algorithm, Simulated annealing, Software patent debate, Spaghetti code, Stack (abstract data type), Stanford University, State diagram, State-transition table, Stephen Cole Kleene, Stony Brook University, Structured program theorem, Sumer, Synthetic rubber, Tabu search, Telegraphy, Teleprinter, The Wall Street Journal, Theory of computation, Thomas E. Kurtz, Ticker tape, Time complexity, Tower of Hanoi, Turing completeness, Turing machine, Unisys, United States Patent and Trademark Office, Verge escapement, Volume, Yuri Gurevich, ZPP (complexity), 0.