Give one example of a unique names axiom and one example of a unique actions axiom that might appear in Evil Robot's knowledge base for this problem. Explain why such axioms are required. [3 marks] Give all the values of (, ) that would minimise the capacity of this channel, and state what that capacity then would be. In the context of virtual memory management: implemented? [4 marks] (ii) What is meant by temporal locality of reference? [2 marks] In particular you should be clear about the behaviour of concurrent invocations of difffferent synchronized methods on the same object, or of the same synchronized method on difffferent objects. [6 marks] Demonstrate the beginning image in the two sentence structures. [8 marks] 6. Many goal based agents are essentially problem solving agents which must decide what to do by searching for a sequence of actions that lead to their solutions. The algorithms that use heuristic functions are called heuristic algorithms. Heuristic algorithms are not really intelligent; they appear to be intelligent because they achieve better performance. Implement a new predicate diffbfs/3 which makes use of a difference list to exploit the benefit you identified in part (i). For neural network systems, we need to search for the set of connection weights that will result in the required input to output mapping. Your predicate should take the same arguments as bfs/2. [8 marks] (ii) A friend observes that a clause in diffbfs/2 will need to contain an empty difference list and proposes two possible ways of representing it, either []-[] or A-A. [8 marks] For production systems, we have seen the need to search for a sequence of rule applications that lead to the required fact or action. Heuristic algorithms are more efficient because they take advantage of feedback from the data to direct the search path. Informed search algorithms use heuristic functions that are specific to the problem, apply them to guide the search through the search space to try to reduce the amount of time spent in searching. Consider a noisy analog communication channel of bandwidth = 1 MHz, which is perturbed by additive white Gaussian noise whose total spectral power is N0 = 1. Continuous signals are transmitted across such a channel, with average transmitted power P = 5,000. How many flip-flops will be required to implement the mystery module, and how will signals c and r be connected to these flip-flops?