COSC 494/594

Unconventional Computation

Fall 2013

Instructor:

Bruce MacLennan, PhD
Phone: 974-0994
Office: Min Kao 550
Office Hours: MW 1:30–2:30, or make an appointment
Email: maclennan AT eecs.utk.edu

Classes: 2:30–3:20 MWF, MK 405

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

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 new 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; collision-based 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. However, students will be expected to be familiar with linear algebra. If you have any questions about whether you should take it, 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.

Text

None.

Student Learning Outcomes

Click here for pdf. 

Tentative List of Topics

  1. Introduction: Lecture Notes I [pdf]
    1. Post-Moore’s law computing
    2. Embodied computing
    3. Super-Turing vs. non-Turing computation
  2. Physical information processing
    1. Energy dissipation: Lecture Notes II.A 
    2. Thermodynamics of computation: LN II.B 
    3.  Reversible computing: LN II.C 
  3. Quantum computation
    1. Mathematical preliminaries: LN III.A and review of complex numbers, FFC-ch4.pdf  
    2. Basic concepts from quantum theory
      1. Postulates of QM: LN III.B.1 
      2. Wave-particle duality: LN III.B.2–4 
      3. Uncertainty principle (additional information on uncertainty principle, FFC-ch6.pdf) 
      4. Dynamics
      5. Superposition: LN III.B.5–7 
      6. No-cloning theorem
      7. Entanglement & EPR paradox
    3. Quantum information
      1. Qubits & secure key distribution: LN III.C.1  
      2. Quantum gates: LN III.C.2  
      3. Quantum circuits: LN III.C.3-5 
      4. Quantum gate arrays
      5. Quantum parallelism
      6. Applications: Superdense coding and quantum teleportation: LN III.C.6 
      7. Universal quantum gates: LN III.C.7 
    4. Quantum algorithms
      1. Deutsch-Jozsa: LN III.D.1 
      2. Simon: LN III.D.2 
      3. Shor: LN III.D.3 
      4. Grover & heuristic search: LN III.D.4 
      5. Quantum error correction: LN III.D.5 
    5. Abrams-Lloyd theorem: LN III.E 
    6. Universal quantum computers: LN III.F 
      1. Feynman
      2. Benioff
      3. Deutsch
    7. Physical realizations: LN III.G 
    8. Quantum probability in cognition: LN III.H

  4. Molecular computation
    1. Basic concepts: LN IV.A 
      1. DNA basics
      2. DNA manipulation
    2. Filtering models
      1. Adleman: LN IV.B.1 
      2. Lipton: LN IV.B.2 
      3. Test tube programming language
      4. Parallel filtering model
    3. Formal models
      1. Sticker systems
      2. Splicing systems
    4. Enzymatic computation
    5. Universal DNA computers
    6. Chemical reaction systems
    7. Membrane systems (Paun)
    8. Summary
  5. Analog computation
    1. Computational power
    2. Computational complexity
  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. Topics for presentations (Nov. 22 – Dec. 2) and term papers (due Dec. 9) 
  2. Exercises for Ch. II (due Sep. 13)
  3. Exercises for Ch. III (due Nov. 13): 28, 29, 31, 32, 35, 36, 38, 39.
  4. Quantum Circuit Project (due Dec. 2). - New!

Simulations

None at this time.

Online Resources

Return to MacLennan’s home page
 
Send mail to Bruce MacLennan / MacLennan@eecs.utk.edu

Valid HTML 4.01!This page is web.eecs.utk.edu/~mclennan/Classes/494-UC or web.eecs.utk.edu/~mclennan/Classes/594-UC
Last updated:  2013-11-21.