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-09-06] – [Syllabus (Tentative)] Martin Ziegler24cs492 [2025-01-12] (current) – Martin Ziegler
Line 1: Line 1:
 ====== Unconventional Computing (CS492A) @KAIST in Fall 2024 ====== ====== Unconventional Computing (CS492A) @KAIST in Fall 2024 ======
-The past decades have seen an exponential growth in digital computing, 
-captured by Moore's Law. This has arguably left a blind spot on alternative  
-approaches to data processing.  
 {{ :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.
 +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. 
  
-In this experimental course we survey, and look into,  +In this experimental course we survey and look into these and other “unconventional” computing paradigms.
-some of these "unconventional" computing paradigms.  +
 ===== Administration ===== ===== Administration =====
  
 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 21: Line 21:
  
 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//
-===== Syllabus (Tentative) ===== 
  
-1. Conventional Computing \\ +Grading: S/U. Students must get assigned and, after the Midterm, present (40~60min) one topic from the textbook 'Unconventional Computing' 
-2. Analog Computing \\ + 
-3. Quantum Computing \\ +Absences: 4 "spontaneous" absences, plus any reasonable pre-excused absences 
-4. Cellular Automata \\ + 
-5. Molecular Computing \\ +===== Syllabus ===== 
-6. DNA Computing \\ + 
-7. Swarm Computing \\ +0. Introduction ({{:ucnc0.ppt|PPT}}, {{:ucnc0.pdf|PDF}}) \\ 
-8. Optical Computing \\ +1. Conventional Computing ({{:ucnc1.ppt|PPT}}, {{:ucnc1.pdf|PDF}}) \\ 
-9. Fluidics \\ +2. Asymptotic Computing  ({{:ucnc2.ppt|PPT}}, {{:ucnc2.pdf|PDF}}) \\ 
-MIDTERM \\ +3. Analog Computing  ({{:ucnc3.ppt|PPT}}, {{:ucnc3.pdf|PDF}}) \\ 
-10.~20: Student presentations: \\ +4. Quantum Computing ({{:ucnc4.ppt|PPT}}, {{:ucnc4.pdf|PDF}}) \\ 
-  * Artificial Chemistry + Reaction-Diffusion + Membrane + P Computing (MSc+4xBSc) +5. Cellular Automata \\ 
-  * DNA+Molecular+Bacterial+Cellular Computing (MSc+4xBSc)+6. Swarm Computing \\ 
 +7ff. Student presentations: \\ 
 +  * Artificial Chemistry + Reaction-Diffusion + Membrane + P Computing (4x) 
 +  * DNA+Molecular+Bacterial+Cellular Computing (4x)
   * Slime Mold Computing   * Slime Mold Computing
   * Reservoir Computing   * Reservoir Computing
   * Amorphous Computing   * Amorphous Computing
   * Social Algorithms   * Social Algorithms
-  * Inductive Turing Machines+  * Inductive Turing Machines (requires CS422!)
   * Unconventional Problems   * Unconventional Problems
  
Line 48: Line 50:
   * https://doi.org/10.1038/s41598-020-68834-1   * https://doi.org/10.1038/s41598-020-68834-1
   * http://doi.org/10.1007/978-1-4939-6883-1   * http://doi.org/10.1007/978-1-4939-6883-1
 +  * http://youtube.com/playlist?list=PLvcvykdwsGNFI1Gz-z4CZXZAtrIdEWTS6