• Challenging variants of the Collatz Conjecture 

      Denend, Matthew Alexander; 0000-0001-7002-7426 (2018-10-12)
      The Collatz Conjecture (also known as the 3N + 1 problem) is simple to explain, yet proving that all positive integers following the Collatz Mapping must converge to 1 has eluded mathematicians for over half a century. ...
    • Chemical richness from abstract physical parts 

      Breik, Keenan Souhail (2020-09-11)
      Every living cell is a tiny, intricate chemical computer. But what aspects of chemistry can create that richness? This thesis explores and expands two abstract models of chemistry, binding networks and chemical linkages, ...
    • Entanglement in superconducting heterostructures, and quantum circuit simulation hardware 

      Ostrove, Corey I (2021-04-27)
      We begin this dissertation by studying noise correlations in superconducting heterostructures of various geometries. In recent years there has been a resurgence of interest in the nonlocal transport properties of superconducting ...
    • Models of streaming computation 

      Kallaugher, John M.; 0000-0003-2591-3298 (2021-08-13)
      Streaming algorithms, which process very large datasets received one update at a time, are a key tool in large-scale computing. This thesis studies the theory of streaming algorithms, and in particular the implications of ...
    • Studies in holographic complexity 

      Couch, Josiah D.; 0000-0002-7416-5858 (2021-05-06)
      This dissertation will present the work I have done on the conjectured relationship between various bulk quantities designed to capture the growth of the wormhole in eternal black hole spacetimes and the circuit complexity ...