Computability | Wikipedia audio article
Channel: wikipedia tts
Date: 13/01/2019

This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/Computability


00:00:46 1 Problems
00:02:09 2 Formal models of computation
00:03:58 3 Power of automata
00:04:22 3.1 Power of finite-state machines
00:04:37 3.2 Power of pushdown automata
00:10:08 3.3 Power of Turing machines
00:10:26 3.3.1 The halting problem
00:14:08 3.3.2 Beyond recursively enumerable languages
00:15:12 4 Concurrency-based models
00:17:29 5 Stronger models of computation
00:19:07 5.1 Infinite execution
00:21:05 5.2 Oracle machines
00:21:33 5.3 Limits of hyper-computation
00:22:01 6 See also
00:24:05 7 References
00:24:37 Limits of hyper-computation
00:25:10 See also



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.9735533712034856
Voice name: en-US-Wavenet-C


"I cannot teach anybody anything, I can only make them think."
- Socrates


SUMMARY
=======
Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within mathematical logic and the theory of computation within computer science. The computability of a problem is closely linked to the existence of an algorithm to solve the problem.
The most widely studied models of computability are the Turing-computable and μ-recursive functions, and the lambda calculus, all of which have computationally equivalent power. Other forms of computability are studied as well: computability notions weaker than Turing machines are studied in automata theory, while computability notions stronger than Turing machines are studied in the field of hypercomputation.