Precision Pulsar Timing and its Applications. The rapidly rotating pulsars known as millisecond pulsars have period stabilities which rival that of the best terrestrial clocks. Observations of many millisecond pulsars spread across the sky should allow detection of the gravitational-wave background - likely to be the first direct detection of gravity waves. It will also enable establishment of a long-term time standard which is independent of and probably superior to that derived from terrestria ....Precision Pulsar Timing and its Applications. The rapidly rotating pulsars known as millisecond pulsars have period stabilities which rival that of the best terrestrial clocks. Observations of many millisecond pulsars spread across the sky should allow detection of the gravitational-wave background - likely to be the first direct detection of gravity waves. It will also enable establishment of a long-term time standard which is independent of and probably superior to that derived from terrestrial clocks. New analysis techniques and establishment of an international observing network will be required. Investigation and application of techniques for overcoming radio interference will be an important part of the project.Read moreRead less
Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is ....Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is relevant to public-key cryptography, where breaking an encryption scheme should be infeasible, and to many real-life situations where NP-complete problems need to be solved, either exactly or approximately.Read moreRead less