The first stage of vision: transduction and adaptation in retinal photoreceptors. The project aims to provide a detailed understanding of the molecular steps involved in the first stage of vision - the conversion of light into a neural signal in the rod and cone photoreceptors of the retina. The significance of this is that it will explain the initial events that enable us to see, and will help explain the deficits that occur when the process fails. The outcome will be a comprehensive understand ....The first stage of vision: transduction and adaptation in retinal photoreceptors. The project aims to provide a detailed understanding of the molecular steps involved in the first stage of vision - the conversion of light into a neural signal in the rod and cone photoreceptors of the retina. The significance of this is that it will explain the initial events that enable us to see, and will help explain the deficits that occur when the process fails. The outcome will be a comprehensive understanding of how our photoreceptors respond with extreme sensitivity, yet great rapidity, and over an enormous range of light intensities, thus endowing us with our remarkable sense of vision.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