Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
24cs492 [2024-11-20] – [Syllabus (Tentative)] Martin Ziegler24cs492 [2025-01-12] (current) – Martin Ziegler
Line 2: Line 2:
 {{ :978-1-4939-6883-1.jpeg?direct&200|}} {{ :978-1-4939-6883-1.jpeg?direct&200|}}
 The past decades have seen an exponential growth in digital electronic computing. The past decades have seen an exponential growth in digital electronic computing.
-But as Moore's Law turns to stagnation, focus turns (back) to alternative approaches to data processing: +But as Moore's Law approaches saturation, focus turns (back) to alternative approaches to data processing: 
 such as analog computing or cellular computing and also quantum computing.  such as analog computing or cellular computing and also quantum computing. 
  
Line 9: Line 9:
  
 Teacher: [[cs492@theoryofcomputation.asia|Martin Ziegler]] (use only this email address!) Teacher: [[cs492@theoryofcomputation.asia|Martin Ziegler]] (use only this email address!)
 +
 +Teaching Assistant: [[cs492@theoryofcomputation.asia|Abbas Mammadov]] (use only this email address!)
  
 Location: online Location: online
Line 20: Line 22:
 Preferred: additional background in (one of) //Physics// OR //Chemistry// OR //Biology// or //CS322// or //CS422// Preferred: additional background in (one of) //Physics// OR //Chemistry// OR //Biology// or //CS322// or //CS422//
  
-Grading: S/U, students must get assigned and, after the Midterm, present (40~60min) one topic from the textbook 'Unconventional Computing'+Grading: S/U. Students must get assigned and, after the Midterm, present (40~60min) one topic from the textbook 'Unconventional Computing'
  
 Absences: 4 "spontaneous" absences, plus any reasonable pre-excused absences Absences: 4 "spontaneous" absences, plus any reasonable pre-excused absences
  
-===== Syllabus (Tentative) =====+===== Syllabus =====
  
 0. Introduction ({{:ucnc0.ppt|PPT}}, {{:ucnc0.pdf|PDF}}) \\ 0. Introduction ({{:ucnc0.ppt|PPT}}, {{:ucnc0.pdf|PDF}}) \\
Line 33: Line 35:
 5. Cellular Automata \\ 5. Cellular Automata \\
 6. Swarm Computing \\ 6. Swarm Computing \\
-MIDTERM \\ +7ff. Student presentations: \\
-10.~20: Student presentations: \\+
   * Artificial Chemistry + Reaction-Diffusion + Membrane + P Computing (4x)   * Artificial Chemistry + Reaction-Diffusion + Membrane + P Computing (4x)
   * DNA+Molecular+Bacterial+Cellular Computing (4x)   * DNA+Molecular+Bacterial+Cellular Computing (4x)