Computable function | Wikipedia audio article
Channel: wikipedia tts
Date: 11/01/2019

This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/Computable_function


00:02:50 1 Definition
00:07:03 2 Characteristics of computable functions
00:11:36 3 Computable sets and relations
00:12:00 4 Formal languages
00:13:37 5 Examples
00:15:01 6 Church–Turing thesis
00:15:53 7 Provability
00:17:30 7.1 Relation to recursively defined functions
00:17:59 7.2 Total functions that are not provably total
00:19:21 8 Uncomputable functions and unsolvable problems
00:20:41 9 Extensions of computability
00:21:34 9.1 Relative computability
00:23:04 9.2 Higher recursion theory
00:23:31 9.3 Hyper-computation
00:24:34 10 See also
00:25:53 11 References
00:27:45 Extensions of computability
00:27:56 Relative computability
00:29:00 Higher recursion theory
00:29:45 Hyper-computation
00:30:19 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.7538429398767992
Voice name: en-US-Wavenet-D


"I cannot teach anybody anything, I can only make them think."
- Socrates


SUMMARY
=======
Computable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion of algorithm, in the sense that a function is computable if there exists an algorithm that can do the job of the function, i.e. given an input of the function domain it can return the corresponding output. Computable functions are used to discuss computability without referring to any concrete model of computation such as Turing machines or register machines. Any definition, however, must make reference to some specific model of computation but all valid definitions yield the same class of functions.
Particular models of computability that give rise to the set of computable functions are the Turing-computable functions and the μ-recursive functions.
Before the precise definition of computable function, mathematicians often used the informal term effectively calculable.   This term has since come to be identified with the computable functions. Note that the effective computability of these functions does not imply that they can be efficiently computed (i.e. computed within a reasonable amount of time). In fact, for some effectively calculable functions it can be shown that any algorithm that computes them will be very inefficient in the sense that the running time of the algorithm increases exponentially (or even superexponentially) with the length of the input. The fields of feasible computability and computational complexity study functions that can be computed efficiently.
According to the Church–Turing thesis, computable functions are exactly the functions that can be calculated using a mechanical calculation device given unlimited amounts of time and storage space. Equivalently, this thesis states that a function is computable if and only if it has an algorithm.  Note that an algorithm in this sense is understood to be a sequence of steps a person with unlimited time and an unlimited supply of pen and paper could follow.
The Blum axioms can be used to define an abstract computational complexity theory on the set of computable functions. In computational complexity theory, the problem of determining the complexity of a computable function is known as a function problem.