Across
- 2. Sequence of unambiguous instructions for solving a problem (8)
- 4. Growth of the form k^n (11)
- 8. Computational __________, how economical an algorithm is with time and space (10)
- 11. Type of function which calls itself
- 12. Executes in reasonable time (9)
- 13. Machine with outputs on transitions (5)
Down
- 1. A famous Alan (6)
- 2. __________ behaviour of f for large values of n (10)
- 3. Form for expressing rules for constructing valid strings (6,4)
- 5. Growth of the form n^k (10)
- 6. Problem with a yes/no answer (9)
- 7. Approach that gives an approximation of a solution (9)
- 9. Machine with outputs on states (5)
- 10. An FSM with no outputs (8)