[EE381V/CS395T] Unconventional Computin

Graduate Course :: Spring 2021 Prof. David Soloveichik

Lecture
TTh 3:30-5p
Online only: join lecture by following Canvas → Zoom

Instructo
Prof. David Soloveichik [[email protected]
Of ce hours: After class, or by appointmen

Teaching Assistan
Niels Kornerup [[email protected]
Of ce hours: TB

Descriptio
There is a world of computation outside of electronic devices: in every biological cell, in your head, in
cutting-edge laboratories trying to create DNA computers and quantum computers. Such unconventional
computation inspires new models of computing beyond traditional models of boolean circuits and
automata. This class exposes you to new perspectives on computation: models of highly distributed and
unstructured computation such as that occurring in chemical reactions, models in which building is
equivalent to computing, models that address the ultimate limits of low energy computation, and models
that compute by relaxing to the lowest energy state. We will also cover the basics of quantum computing.
The course will focus on proving important properties of the various models, and on how to use the
models to achieve desired computational behavior

Tentative Topic
1. Extreme distributed computing: Chemical Reaction Networks, Population Protocol
• deterministic computation and its limitation
• kinetics and time analysi
• “analog”/real valued computation, oscillators, chaotic system

2. Almost anything can compute everything: Cellular Automata, Algorithmic Tile Assembly Mode
• elementary CAs, game of lif
• complexity of self-assembly, busy beaver Turing machine

3. Computing by relaxing: Thermodynamic Computin

• protein foldin
• Thermodynamic Binding Network
• Hop eld network

4. Computing without using energy: Reversible Computin

• reversible Turing machine
• Bennett’s simple and space-ef cient construction
fi
fi
fi
m

fi
t

 • optimality of the reversible pebble gam

5. Basics of Quantum Computin

• foundations, oracle query mode
• destructive interference: Bernstein-Vazirani Problem, Deutsch-Jozsa Algorith
• (if time permits) Quantum Fourier Transform and Shor’s factoring algorith

6. Other: Mechanical computers, DNA Computin

Prerequisite
Experience with proofs (e.g., discrete math, algorithms
Helpful: automata theory (Turing machines), logic circuits, undergraduate probability, basic differential
equation

No physics, chemistry, or biology background neede

Grading
Homework (65%), Mid Project (10%), Final Project (25%

Attendance at all classes is expected, but not part of the grade. Similarly, keeping your camera on during
class is expected but not required

Homework policy
Homework must be typed and submitted to Gradescope. “Star” homework problems are not extra
credit. These problems are less well-de ned than the others/ closer to a research problem (this is a
graduate class!) Use your judgement to understand the bigger picture. Feel free to reach out to me or to
the TAs.

Late homework will be accepted only until the time when solutions are posted. The penalty will be –20%
per 24 hour period. This penalty is assessed after normal grading and is cumulative with any points lost
(e.g. a homework that would normally receive 80% of total points would receive only 40% if handed in
within 48 hours)

Homework sets and solutions may not be shared online or with anyone outside of the class unless you
have my explicit, written permission. Unauthorized sharing of materials promotes cheating. It is a violation
of the University’s Student Honor Code and an act of academic dishonesty. Any suspected unauthorized
sharing of materials, will be reported to Student Conduct and Academic Integrity in the Of ce of the Dean
of Students. These reports can result in sanctions, including failure in the course.

Collaboration policy
You may discuss homework problems with other students, but the solutions turned in must be written
entirely by you. You must write the names of all the students you collaborated with at the top of
your homework. Copying on homework assignments will result in an automatic zero for the assignment
for both students as well as other consequences (e.g., failure and disciplinary action). Close collaboration
is expected for group projects, with all students meaningfully contributing

fi
g

fi
Textbook / reading material
There is no textbook for this course. You are strongly urged to attend all classes and participate during
discussions. Where possible, PDF copies of optional reading materials will be provided

University policie
FERPA and Class Recordings. Class recordings are reserved only for students in this class for
educational purposes and are protected under FERPA. The recordings should not be shared outside the
class in any form. Violation of this restriction by a student could lead to Student Misconduct proceedings.

Religious holy days. By UT Austin policy, you must notify me of your pending absence at least fourteen
days prior to the date of observance of a religious holy day. If you must miss a class, an examination, a
work assignment, or a project in order to observe a religious holy day, I will give you an opportunity to
complete the missed work within a reasonable time after the absence

Students with Disabilities. The University of Texas at Austin provides, upon request, appropriate
academic adjustments for quali ed students with disabilities. If you have a disability that warrants such
adjustments, either during class or during an exam, please give the instructor a letter from the Dean of
Students describing what needs to be done. You should do this during the rst week of classes. For more
information, contact the Of ce of the Dean of Students at 512-471-6259, or visit http://www.utexas.edu/
diversity/ddce/ssd/.

fi
s

fi
s

fi
.