Term | Main definition |
---|---|

Algorithm | In orgtology we use the terms “algorithm” and “process” synonymously. The term “algorithm” is mostly used in mathematics and computer science. It is an unambiguous specification of how to solve problems, perform calculations, do data processing, devise automated reasoning, and other tasks. In orgtology we see it as a set of rules that dictate the movement of activity to produce a predetermined output. We therefore see it as a process within Org. A process is any progressive movement towards a specific or general result. Process therefore directly implies causality, which means that there is always a cause that ignites an effect. In this “stimulus – response” relationship we must define several variables in relation to one another. Such variables are: dependency flow; time; task; authority; resources; outputs; targets; etc. A process implies transformation, and the result is always change at some level. Processes can be conscious or subconscious. Planning and corporate reengineering are conscious processes, whilst survival and evolution are subconscious processes. Any sequence of activity will create a process. Therefore, all projects and procedures are processes. Yet, not all processes are procedures or projects. All processes have a specific algorithm.
## General Description...In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing, automated reasoning, and other tasks. As an effective method, an algorithm can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.The concept of algorithm has existed for centuries. Greek mathematicians used algorithms in the sieve of Eratosthenes for finding prime numbers, and the Euclidean algorithm for finding the greatest common divisor of two numbers.The word algorithm itself is derived from the 9th century mathematician Muḥammad ibn Mūsā al-Khwārizmī, Latinized Algoritmi. A partial formalization of what would become the modern concept of algorithm began with attempts to solve the Entscheidungsproblem (decision problem) posed by David Hilbert in 1928. Later formalizations were framed as attempts to define "effective calculability" or "effective method". 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–37 and 1939.
Hits - 920 |

Copyright ©
2021
The International Orgtology Institute