Computability theory (computation) | Wikipedia audio article

This is an audio version of the Wikipedia Article: https://en.wikipedia.org/wiki/Computability_theory 00:01:07 1 Computable and uncomputable sets 00:04:48 2 Turing computability 00:07:53 3 Areas of research 00:08:25 3.1 Relative computability and the Turing degrees 00:14:47 3.2 Other reducibilities 00:17:43 3.3 Rice's theorem and the arithmetical hierarchy 00:18:03 3.4 Reverse mathematics 00:19:14 3.5 Numberings 00:19:24 3.6 The priority method 00:20:13 3.7 The lattice of recursively enumerable sets 00:20:22 3.8 Automorphism problems 00:21:17 3.9 Kolmogorov complexity 00:23:18 3.10 Frequency computation 00:24:51 3.11 Inductive inference 00:26:49 3.12 Generalizations of Turing computability 00:28:11 3.13 Continuous computability theory 00:28:28 4 Relationships between definability, proof and computability 00:29:03 5 Name 00:29:13 6 Professional organizations 00:30:21 7 See also 00:31:52 8 Notes 00:32:31 9 References 00:34:54 10 External links 00:37:08 Professional organizations 00:37:38 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.8647547947935388 Voice name: en-US-Wavenet-F "I cannot teach anybody anything, I can only make them think." - Socrates SUMMARY ======= Computability theory, also known as recursion theory, is a branch of mathematical logic, of computer science, and of the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since expanded to include the study of generalized computability and definability. In these areas, recursion theory overlaps with proof theory and effective descriptive set theory. Basic questions addressed by recursion theory include: What does it mean for a function on the natural numbers to be computable? How can noncomputable functions be classified into a hierarchy based on their level of noncomputability?Although there is considerable overlap in terms of knowledge and methods, mathematical recursion theorists study the theory of relative computability, reducibility notions, and degree structures; those in the computer science field focus on the theory of subrecursive hierarchies, formal methods, and formal languages.