Consider these tasks that a computing device might be programmed to perform. Compute xy for any two positive integers x and y. Compute the Busy Beaver number beta(n), for all natural numbers n. Decide whether any given binary string has an even number of 1s. Decide whether a string of parentheses is correctly closed and nested (e.g., for algebraic expressions or computer coding) Factorise any 24-digit number. Decide whether a given Turing machine will halt when started from a blank tape In your examination booklet, draw up a copy of the following table. In each vacant cell, place a tick if the computing device named at the top could solve the problem as numbered (assuming a sufficiently clever programmer and sufficiently large memory capacity for both program and execution, and sufficient time available to run it) or a cross if it could not solve it