Richard J. Coles

Learn More
A real is computable if its left cut, L; is computable. If q i i is a computable sequence of rationals computably converging to ; then fq i g; the corresponding set, is always computable. A computably enumerable c.e. real is a real which is the limit of an increasing computable sequence of rationals, and has a left cut which is c.e. We study the Turing(More)
0 1 classes are important to the logical analysis of many parts of mathematics. The 0 1 classes form a lattice. As with the lattice of computable enumerable sets, it is natural to explore the relationship between this lattice and the Turing degrees. We focus on an analog of maximality namely the notion of a thin class. We prove a number of results relating(More)
We present a waveguide-coupled photonic crystal H1 cavity structure in which the orthogonal dipole modes couple to spatially separated photonic crystal waveguides. Coupling of each cavity mode to its respective waveguide with equal efficiency is achieved by adjusting the position and orientation of the waveguides. The behavior of the optimized device is(More)
Scalable quantum technologies may be achieved by faithful conversion between matter qubits and photonic qubits in integrated circuit geometries. Within this context, quantum dots possess well-defined spin states (matter qubits), which couple efficiently to photons. By embedding them in nanophotonic waveguides, they provide a promising platform for quantum(More)
  • 1