Algorithm design | Wikipedia audio article
Channel: wikipedia tts
Date: 2019-06-27

This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/Algorithm


00:01:56 1 Etymology
00:04:20 2 Informal definition
00:06:45 3 Formalization
00:07:30 3.1 Expressing algorithms
00:10:38 4 Design
00:12:53 5 Implementation
00:14:02 6 Computer algorithms
00:14:31 7 Examples
00:21:58 7.1 Algorithm example
00:22:07 7.2 Euclid's algorithm
00:23:13 7.2.1 Computer language for Euclid's algorithm
00:25:01 7.2.2 An inelegant program for Euclid's algorithm
00:25:41 7.2.3 An elegant program for Euclid's algorithm
00:25:45 7.3 Testing the Euclid algorithms
00:28:41 7.4 Measuring and improving the Euclid algorithms
00:29:58 8 Algorithmic analysis
00:30:48 8.1 Formal versus empirical
00:32:11 8.2 Execution efficiency
00:34:14 9 Classification
00:34:36 9.1 By implementation
00:35:48 9.2 By design paradigm
00:37:22 9.3 Optimization problems
00:38:08 9.4 By field of study
00:38:23 9.5 By complexity
00:42:21 10 Continuous algorithms
00:45:49 11 Legal issues
00:50:05 12 History: Development of the notion of "algorithm"
00:51:04 12.1 Ancient Near East
00:52:24 12.2 Discrete and distinguishable symbols
00:53:01 12.3 Manipulation of symbols as "place holders" for numbers: algebra
00:54:04 12.4 Mechanical contrivances with discrete states
00:54:16 12.5 Mathematics during the 19th century up to the mid-20th century
00:54:50 12.6 Emil Post (1936) and Alan Turing (1936–37, 1939)
00:55:30 12.7 J.B. Rosser (1939) and S.C. Kleene (1943)
00:56:21 12.8 History after 1950
01:01:15 13 See also
01:04:35 14 Notes
01:10:23 15 Bibliography
01:12:57 16 Further reading
01:13:29 17 External links
01:13:39 Notes
01:13:48 Bibliography
01:13:57 Further reading
01:14:06 External links



Listening is a more natural way of learning, when compared to reading. Written language only began at around 3200 BC, but spoken language has existed long ago.

Learning by listening is a great way to:
- increases imagination and understanding
- improves your listening skills
- improves your own spoken accent
- learn while on the move
- reduce eye strain

Now learn the vast amount of general knowledge available on Wikipedia through audio (audio article). You could even learn subconsciously by playing the audio while you are sleeping! If you are planning to listen a lot, you could try using a bone conduction headphone, or a standard speaker instead of an earphone.

Listen on Google Assistant through Extra Audio:
https://assistant.google.com/services/invoke/uid/0000001a130b3f91
Other Wikipedia audio articles at:
https://www.youtube.com/results?search_query=wikipedia+tts
Upload your own Wikipedia articles through:
https://github.com/nodef/wikipedia-tts
Speaking Rate: 0.9976038862100259
Voice name: en-US-Wavenet-C


"I cannot teach anybody anything, I can only make them think."
- Socrates


SUMMARY
=======
In mathematics and computer science, an algorithm ( (listen)) is a set of instructions, typically to solve a class of problems or perform a computation. Algorithms are unambiguous specifications for performing 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.