I was doing some resarch on TRIZ a neat problem solving system and noticed a wiki on this word Algorithm. I think Community Futures of the Okanagan has developed a great process for sourcing and launching new ideas. Like the example here they have people who have had a light bulb moment and want coaching to start that business.

# Algorithm

This is an algorithm that tries to figure out why the lamp doesn’t turn on and tries to fix it using the steps. Flowcharts are often used to represent algorithms graphically.

In mathematics, computer science, and related subjects, an **algorithm** is an effective method for solving a problem expressed as a finite sequence of instructions. Algorithms are used for calculation, data processing, and many other fields. (In more advanced or abstract settings, the instructions do not necessarily constitute a finite sequence, and even not necessarily a sequence; see, e.g., “nondeterministic algorithm“.)

Each algorithm is a list of well-defined instructions for completing a task. Starting from an initial state, the instructions describe a computation that proceeds through a well-defined series of successive states, eventually terminating in a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized 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”^{[1]} or “effective method”;^{[2]} 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.

The adjective “continuous” when applied to the word “algorithm” can mean: 1) An algorithm operating on data that represents continuous quantities, even though this data is represented by discrete approximations – such algorithms are studied in numerical analysis; or 2) An algorithm in the form of a differential equation that operates continuously on the data, running on an analog