Computer Sciences

Finding control in hard-to-predict systems

Input one, output one; input two, output two; input three; output purple—what kind of system is this? Computer algorithms can exist as non-deterministic systems, in which there are multiple possible outcomes for each input. ...

Computer Sciences

T-GPS processes a graph with a trillion edges on a single computer

A KAIST research team has developed a new technology that enables the processing of a large-scale graph algorithm without storing the graph in the main memory or on disk. Named as T-GPS (Trillion-scale Graph Processing Simulation) ...

Computer Sciences

Algorithms improve how we protect our data

Daegu Gyeongbuk Institute of Science and Technology (DGIST) scientists in Korea have developed algorithms that more efficiently measure how difficult it would be for an attacker to guess secret keys for cryptographic systems. ...

Electronics & Semiconductors

Toward new solar cells with active learning

How can I prepare myself for something I do not yet know? Scientists from the Fritz Haber Institute in Berlin and from the Technical University of Munich have addressed this almost philosophical question in the context of ...

page 1 from 8


In mathematics, computing, linguistics, and related subjects, an algorithm is a finite sequence of instructions, an explicit, step-by-step procedure for solving a problem, often used for calculation and data processing. It is formally a type of effective method in which a list of well-defined instructions for completing a task, will when given an initial state, proceed through a well-defined series of successive states, eventually terminating in an end-state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as probabilistic algorithms, incorporate randomness.

A partial formalization of the concept began with attempts to solve the Entscheidungsproblem (the "decision problem") posed by David Hilbert in 1928. Subsequent formalizations were framed as attempts to define "effective calculability" (Kleene 1943:274) or "effective method" (Rosser 1939:225); those formalizations included the Gödel-Herbrand-Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's "Formulation 1" of 1936, and Alan Turing's Turing machines of 1936–7 and 1939.

This text uses material from Wikipedia, licensed under CC BY-SA