Computational problem | Wikipedia audio article
Channel: wikipedia tts
Date: 2019-01-13

This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/Computational_problem


00:01:32 1 Types of computational problems
00:05:02 2 Promise problem
00:06:46 3 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.8441829812407118
Voice name: en-GB-Wavenet-C


"I cannot teach anybody anything, I can only make them think."
- Socrates


SUMMARY
=======
In theoretical computer science, a computational problem is a mathematical object representing a collection of questions that computers might be able to solve.  For example, the problem of factoring

"Given a positive integer n, find a nontrivial prime factor of n."is a computational problem.  Computational problems are one of the main objects of study in theoretical computer science.  The field of algorithms studies methods of solving computational problems efficiently.  The complementary field of computational complexity attempts to explain why certain computational problems are intractable for computers.
A computational problem can be viewed as an infinite collection of instances together with a solution for every instance.  For example, in the factoring problem, the instances are the integers n, and solutions are prime numbers p that describe nontrivial prime factors of n.  
It is conventional to represent both instances and solutions by binary strings, namely elements of {0, 1}*. For example, numbers can be represented as binary strings using the binary encoding. (For readability, we identify numbers with their binary encodings in the examples below.)