|
Projects
|
|
|
Each class member should choose a time in the following schedule after they have an approved topic chosen. Talk times should be 30-35 minutes. You may use the whiteboard or a computer projector for given your talk. Schedule of Presentations
Papers Chris - David Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer Shiv - Samuel J. Lomonaco, Jr., A Quick Glance at Quantum Cryptography Loren - Calude and P˘aun, Bio-steps beyond Turing Raj - Yao-Ting Huang, Kun-Mao Chao and Ting Chen, An Approximation Algorithm for Haplotype Inference by Maximum Parsimony Arun - Decidability of Logical Theories (Section 6.2 in the textbook) Alok - Paul Wilhelm, Karl Rothemund, A DNA and restriction enzyme implementation of Turing Machines. Richard Beigel, Bin Fu, Solving Intractable Problems with DNA Computing. Shen - Toby Ord, Hypercomputation: computing more than the Turing machine Sam - Grinstein, Can complex structures be generically stable in a noisy world? Link to presentation. Brian - Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu, Finding Collisions in the Full SHA-1 Tom - Giorgi Japaridze, Computability logic: a formal theory of interaction |