Features of a computable problem (2.2.2 a)

Question 1

What is a tractable problem?

Answer 1

any problem that can be solved in polynomial time or better
the algorithm to solve the problem will run quickly enough to be practical and useful

Question 2

Features of a computable problem

Answer 2

enumeration
theoretical approach
abstraction
decomposition
simulation and automation

Question 3

abstraction and decomposition - features that make a problem solvable

Answer 3

simplify the complexity of a problem and break it down makes it far easier to write an algorithm to solve the problem

Question 4

Enumeration - features that make a problem solvable

Answer 4

designing an algorithm that performs an exhaustive search and attempts all possible solutions until the correct one is found

Question 5

Theoretical approach - features that make a problem solvable

Answer 5

if problem can be boiled down to pure theory it becomes easier to represent using maths equations
great candidates for being solved by an algorithm

Question 6

Simulation and automation - features that make a problem solvable

Answer 6

simulation is he process of designing a model of a real system in an attempt to understand its behaviour
automation is about building problem solving models and putting them into action
both tend to make heavy use of abstraction and are ways of turning complex problems into ones that can be more eaesily solved by algorithms