Unconventional Computation

Instructor:

Bruce MacLennan [he/his/him]
Phone: 974-0994
Office: Min Kao 550
Office Hours: WF 2:30–3:30, or make an appointment
Email: maclennan AT utk.edu

Classes: 1:25–2:15 MWF, MK 404

Directory of Handouts, Labs, etc.

This page: http://web.eecs.utk.edu/~mclennan/Classes/494-UC
or http://web.eecs.utk.edu/~mclennan/Classes/594-UC

Information

• Description
• Prerequisites
• Grading
• Text
• Student Learning Outcomes
• Accommodations
  
• Evolving List of Topics 
• Projects/Assignments  
• Simulators 
• Online Resources 
• Project Data Files (currently none)
  
  
• MacLennan’s home page
• Department of Electrical Engineering & Computer Science
• UTK Home Page
• Campus Syllabus [pdf]
  

Description

Unconventional computation (or non-standard computation) refers to the use of non-traditional technologies and computing paradigms. As we approach the limits of Moore’s Law, progress in computation will depend on going beyond binary electronics and on exploring new paradigms and technologies for information processing and control. This course surveys some potential approaches to post-Moore’s Law computing.

Potential topics include quantum computation and quantum annealing; optical computing; analog computing; DNA, RNA, peptide, and general molecular computation; chemical computing; reaction-diffusion systems; liquid-state machines; amorphous computing; membrane computing and P systems; single organic molecule computing; computational mechanics; ballistic computing; reversible computing; spatial computation; cellular automata; cellular neural nets; neurocomputers; organic computation; natural computation; physarum computers; emergent computation; hypercomputation; non-Turing computation.

Prerequisites

I intend this course to be accessible to all upper-division undergraduate and graduate students in computer science, computer engineering, electrical engineering, mathematics, physics, and similar disciplines. To get the most out of the course, undergraduate CS majors should have completed the 300-level required courses. Students will be expected to be familiar with linear algebra. If you have any questions about whether you should take this course, please email me. Students taking the course for graduate credit (COSC 594) will be expected to do specified additional work, including an in-class presentation.

Grading

There will be a mixture of homework, simulation experiments, and a term paper. Graduate students will be expected to do an in-class presentation. Occasional pop quizzes will count for 10% of your grade.

Text

None.

Student Learning Outcomes

Click here for pdf.

Accommodations

For Students with Disabilities

Students who have a disability that requires accommodation(s) should make an appointment with the Office of Disability Services (974-6087) to discuss their specific needs as well as schedule an appointment with me during my office hours.

Name and Pronoun Accommodations

If you use a name and/or pronouns other than what is in the course roll, please email me with the name and/or pronouns that you would like me to use and I will be glad to accommodate this request.

Tentative List of Topics

1. Introduction [LNUC I (pdf); slides: pdf]
   
1. Post-Moore’s law computing
2. Embodied computing
3. Super-Turing vs. non-Turing computation
   
2. Physical information processing
1. Energy dissipation  [LNUC II.A-B]  
2. Thermodynamics of computation  
3. Reversible computing [LNUC II.C]  
3. Quantum computation
1. Mathematical preliminaries [LNUC III.A]  (see also complex number review [FFC-ch4]) 
2. Basic concepts from quantum theory
1. Introduction [LNUC III.B.1–3] 
   
2. Postulates of QM
3. Wave-particle duality (supplementary) 
4. Superposition [LNUC III.B.4–6]  
5. No-cloning theorem
6. Entanglement & EPR paradox
   
7. Uncertainty principle (supplementary) [LNUC III.B.7]  
3. Quantum information
1. Qubits & secure key distribution [LNUC III.C.1]  
2. Quantum gates [LNUC III.C.2] 
3. Quantum circuits [LNUC III.C.3–5] 
4. Quantum gate arrays
   
5. Quantum parallelism 
6. Applications: Superdense coding and quantum teleportation [LNUC III.C.6–7]  
7. Universal quantum gates  
4. Quantum algorithms
1. Deutsch-Jozsa [LNUC III.D.1]  
2. Simon [LNUC III.D.2]  
3. Shor [LNUC III.D.3] 
4. Grover & heuristic search [LNUC III.D.4]  
5. Quantum error correction  [LNUC III.D.5] 
5. Abrams-Lloyd theorem [LNUC III.E]  
6. Universal quantum computers (supplementary) [LNUC III.F]  
   
1. Feynman
2. Benioff
3. Deutsch
7. Physical realizations  
8. Quantum probability in cognition [LNUC III.G] 
   
   
4. Molecular computation
1. Basic concepts  [LNUC IV.A] 
1. DNA basics
2. DNA manipulation
2. Filtering models
1. Adleman [LNUC IV.B.1]  
2. Lipton [LNUC IV.B.2]  
3. Test tube programming language (supplementary) [LNUC IV.B.3–4]  
4. Parallel filtering model (supplementary)
3. Formal models [LNUC IV.C] 
1. Sticker systems
2. Splicing systems (supplementary)
4. Enzymatic computation  [LNUC IV.D]  
5. Analog computation [LNUC V] (read sections A–B) 
1. Computational power
2. Computational complexity
3. Analog solution of k-SAT [Analog-SAT] 
6. Spatial computation
1. Cellular automata
2. Cellular neural networks
   
3. Computing with solitons etc.
4. Reaction-diffusion computing
5. Biocomputing
6. Physarum machines
7. Unstructured computation
1. Liquid-state machines
2. Reservoir computing
3. Amorphous computing
4. Blob computing
5. Self-assembling systems
8. Other potential topics
1. Field computation
2. Optical computing
3. Carbon nanotubes
4. Spintronics
   
5. Relativistic computing
6. Abstract geometrical computation
7. Arithmetical hierarchy
8. Algebraic TM computation
9. Infinite-time computation

Assignments

1. Homework 1 due Sept. 14 (LNUC II.D). Do 1, 4–9.
2. Homework 2 due Sept. 26 (LNUC III.H.1–31). Do 1, 2, 14, 19, 20, 23, 27.
   
3. Homework 3 due Oct. 26 (LNUC III.G.43–49). Do 43–49.
   
4. Homework 4 due Nov. 21 (pdf). 
5. Topics for term papers (due Dec. 8).
   Presentation slides:
   
1. Adiabatic Quantum Computing (John Reynolds) 
2. D-Wave Adiabatic Quantum Computer (Erica Grant)
3. Topological Quantum Computing (Megan Lilly) 
4. Quantum Cellular Automata (Andrew Valesky)
5. Quantum Probability (Camille Crumpton)
6. Membrane Systems / P-systems (Mesbah Uddin and Gangotree Chakma)
   
7. Computing with Slime Mold (Kelley Deuso)
8. Reservoir Computing (Alex Klibisz)

Simulations

• jQuantum

Online Resources

• Unconventional and Non-standard Computing in general:
  
• International Journal of Unconventional Computing
• Unconventional Computation and Natural Computation international conference series
  
• Unconventional Computation: Quo Vadis? (Santa Fe Institute)
  
• UPSIDE:new DARPA program in unconventional computing 
• International Center of  Unconventional Computing (University of the West of England)
• Parallel and Unconventional Computing Group (Queen’s University, Kingston, Ontario, Canada)
  
• M. Jayapala’s page of non-standard computation resources
  
• Non-standard computation course at Princeton (K. Steiglitz)
  
• Non-standard computation course at Portland State (M. Mitchell)
• Quantum Computing:
• Abrams & Lloyd: “Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems” [pdf]
  
• Miscellaneous
• Bibliography for Lecture Notes [pdf]
  
• Course web sites including lecture notes from Fall 2015.
• Course web sites including lecture notes from Fall 2014. 
• Course web sites including lecture notes from Fall 2013.
• Course web sites including lecture notes from Fall 2012.
  

Send mail to Bruce MacLennan / MacLennan@utk.edu

This page is web.eecs.utk.edu/~mclennan/Classes/494-UC or web.eecs.utk.edu/~mclennan/Classes/594-UC
Last updated:  2016-11-28.