The axiomatic treatment of the computational complexity of partial recursive functions initiated by Blum is extended to relatively computable functions (as computed, for example, by Turing machines ...

In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...

Linear optics represents one of the best examples for demonstrating quantum physics. It works at room temperatures, and can be observed with relatively simple devices. In linear optics, one studies ...

Karlo Doroc receives funding from a University of Melbourne Graduate Research Scholarship from the Faculty of Business and Economics, a Kinsman Scholarship, and Australian Government Research Training ...