Mathematical recursion | Wikipedia audio article
This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/Recursion
00:00:05 1 Formal definitions
00:00:11 2 Informal definition
00:00:17 3 In language
00:00:23 3.1 Recursive humor
00:00:29 4 In mathematics
00:00:32 4.1 Recursively defined sets
00:00:35 4.1.1 Example: the natural numbers
00:00:40 4.1.2 Example: Proof procedure
00:00:46 4.2 Finite subdivision rules
00:00:52 4.3 Functional recursion
00:00:58 4.4 Proofs involving recursive definitions
00:01:04 4.5 Recursive optimization
00:01:10 4.6 The recursion theorem
00:01:16 4.6.1 Proof of uniqueness
00:01:21 5 In computer science
00:01:27 6 In art
00:01:33 7 See also
00:01:39 8 References
00:01:45 9 Bibliography
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.7243785591687403
Voice name: en-GB-Wavenet-C
"I cannot teach anybody anything, I can only make them think."
- Socrates
SUMMARY
=======
Recursion (adjective: recursive) occurs when a thing is defined in terms of itself or of its type. Recursion is used in a variety of disciplines ranging from linguistics to logic. The most common application of recursion is in mathematics and computer science, where a function being defined is applied within its own definition. While this apparently defines an infinite number of instances (function values), it is often done in such a way that no loop or infinite chain of references can occur.