Programming a new reality
    Neil Gershenfeld
    TEDxCERN, 2015

    Computational Capacity of the Universe
    Seth Lloyd
    Phys. Rev. Lett.
    88, 237901 - Published 24 May 2002

    On the decrease of entropy in a thermodynamic system by intervention of intelligent beings, Maxwell's Demon
    Leo Szilard
    Zeitschift fur Physic 53: 840-856 (1929)

    On computable numbers, with an application to the Entscheidungsproblem
    Alan Mathison Turing
    J. of Math 58.345-363 (1936): 5

    A symbolic analysis of relay and switching circuits
    C.E. Shannon
    MS Thesis, Massachusetts Institute of Technology
    August 10, 1937

    Certain results in coding theory for noisy channels
    Claude E. Shannon
    Information and control 1, no. 1 (1957): 6-25

    First Draft of a Report on the EDVAC
    John von Neumann
    Contract No. W-670-ORD-4926
    June 30, 1945

    Probabilistic logics and the synthesis of reliable organisms from unreliable components
    John von Neumann
    Automata studies, Annals of mathematics studies, no. 34,
    Princeton University Press, Princeton, N. J., 1956, pp. 43-98

    Reliable circuits using less reliable relays
    Edward F. Moore and Claude E. Shannon
    Journal of the Franklin Institute 262, no. 3 (1956): 191-208

    A Defect-Tolerant Computer Architecture: Opportunities for Nanotechnology
    James R. Heath, Philip J. Kuekes, Gregory S. Snider, R. Stanley Williams
    Science
    Vol 280, pp. 1716-1721, 1998

    Irreversibility and Heat Generation in the Computing Process
    R. Landauer
    IBM Journal, pp. 183-191, July 1961

    The Thermodynamics of Computation - A Review
    Charles H. Bennett
    International Journal of Theoretical Physics
    Vol. 21, No. 12, 1982, pp. 905-940

    Signal Entropy and the Thermodynamics of Computation
    Neil Gershenfeld
    IBM Systems Journal 35, pp. 577-587 (1996)

    Conservative Logic
    Edward Fredkin and Tommaso Toffoli
    in Collision-Based Computing, A. Adamatzky (ed.)
    pp. 47-81, 2002

    DNA molecule provides a computing machine with both data and fuel
    Yaakov Benenson, Rivka Adar, Tamar Paz-Elizur, Zvi Livneh, and Ehud Shapiro
    Proceedings of the National Academy of Sciences
    March 4, 2003 vol. 100 no. 5 2191-2196

    The Chemical Basis of Morphogenesis
    A. M. Turing
    Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences,
    Vol. 237, No. 641. (Aug. 14, 1952), pp. 37-72.

    Theory of Self-Reproducing Automata
    John von Neumann, Arthur W. Burks
    University of Illinois Press, 1966

    OTCA Metapixel - Conway's Game of Life
    Brice Due, 2006

    Microfluidic Bubble Logic
    Manu Prakash, Neil Gershenfeld
    Science
    09 Feb 2007: Vol. 315, Issue 5813, pp. 832-835

    Physics-like models of computation
    Norman Margolus
    Physica D: Nonlinear Phenomena
    Volume 10, Issues 1-2, January 1984, Pages 81-95

    Computational complexity
    Christos H. Papadimitriou
    Encyclopedia of Computer Science
    4th edition, Pages 260-265
    John Wiley and Sons

    Aligning the representation and reality of computation with asynchronous logic automata
    Neil Gershenfeld
    Computing
    December 2011, Volume 93, Issue 2, pp 91-102

    Modelling cellular automata with partial differential equations
    Stephen Omohundro
    Physica D: Nonlinear Phenomena
    Volume 10, Issues 1-2, January 1984, Pages 128-134

    Unpredictability and undecidability in dynamical systems
    Cristopher Moore
    Phys. Rev. Lett.
    64, 2354 - Published 14 May 1990

    Mathematical programming and electrical networks
    Jack B. Dennis
    Thesis (Sc. D.)--Massachusetts Institute of Technology
    1959

    Continuous-time analog circuits for statistical signal processing
    Ben Vigoda
    Thesis (Ph. D.)--Massachusetts Institute of Technology
    2003

    Elementary gates for quantum computation
    Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter
    Phys. Rev. A
    52, 3457 - Published 1 November 1995

    Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
    Peter W. Shor
    SIAM review 41, no. 2 (1999): 303-332

    Quantum computers can search rapidly by using almost any transformation
    Lov K. Grover
    Physical Review Letters 80, no. 19 (1998): 4329

    Bulk Spin-Resonance Quantum Computation
    Neil A. Gershenfeld, Isaac L. Chuang
    Science
    17 Jan 1997: Vol. 275, Issue 5298, pp. 350-356

    Exprimental Implementation of Fast Quantum Searching
    Isaac L. Chuang, Neil Gershenfeld, and Mark Kubinec
    Physical Review Letters 80, pp. 3408-3411 (1998)

    Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
    Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev
    SIAM Rev.
    50(4), 755-787, 2008