1. There are two main things that are said to impose limits on what can be computed: algorithmic complexity and ______________
2. Which of the following are areas that need to be considered when it comes to the limits of algorithms?
3. Problems that have a polynomial (or less) time solution are called:
4. Problems that have no polynomial (or less) time solution are called:
5. Computing based solutions in the form of algorithms can be used to solve all possible problems
6. If a specific problem required _________________ than is feasible, it could be rendered effectively 'unsolvable'
7. Certain problems have what is called exponential complexity. This means that the problems requires an _____________________________.
8. If a problem has exponential complexity, using faster or more processors (e.g. improving hardware) would make a world of difference and improve efficiency.
9. Intractable problems can be made more efficient and useful (in terms of time) by using _________________
10. There are certain problems that computers may never be able to solve e.g. the halting problem, wang tile problem, kolmogorov complexity