FPF:UIDI009 New Computation Media for AS - Course Information
UIDI009 New Computation Media for Autonomous Systems
Faculty of Philosophy and Science in OpavaSummer 2019
- Extent and Intensity
- 0/0. 0 credit(s). Type of Completion: dzk.
- Guaranteed by
- doc. Ing. Petr Sosík, Dr.
Institute of Computer Science – Faculty of Philosophy and Science in Opava - Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Autonomous Systems (programme FPF, P1801 Inf) (2)
- Autonomous Systems (programme FPF, P1801 Inf) (2)
- Course objectives
- The course introduces a selection of computing media and platforms (mostly in an experimental phase) alternative to the recent silicon computer technology. This technology is reaching its physical limitations and alternative computing approaches are sought.
- Syllabus
- 1. Abstract computing classes, Turing Machine with oracle and advice, the problem P versus NP, possible strategies of solution of computationally intractable problems.
2. Why do we need new computing media? Problems of the recent technologies concepts of computing.
3. Quantum computing, bits and qubits, reversibility of computing. Quantum gates and networks, quantum algorithms, quantum parallelism.
4. Deutsch problem XOR, Shore factorization algorithm. The problem of decoherency. The performance of quantum algorithms.
5. DNA computing, elementary properties of DNA. The PCR reaction, denaturation and hybridization, cutting and pasting, separation of molecules with the use of gel electrophoresis.
6. Computing based on recombination and on cutting/pasting. Two- and three-dimensional DNA structures. Possible applications in medicine and nanotechnologies.
7. Further biologically and chemically inspired computing models. Abstract chemical machine, membrane computing.
8. Evolutionary computing, interactive finite automata and interactive Turing machine. Evolutionary lineages of cognitive automata and their performance.
- 1. Abstract computing classes, Turing Machine with oracle and advice, the problem P versus NP, possible strategies of solution of computationally intractable problems.
- Literature
- Teaching methods
- Interactive lecture
Lecture with a video analysis - Assessment methods
- Exam
- Language of instruction
- Czech
- Further comments (probably available only in Czech)
- The course can also be completed outside the examination period.
- Teacher's information
- A study of selected new media topics due to teacher's recommendation related to the PhD thesis of the student, an oral exam.
- Enrolment Statistics (Summer 2019, recent)
- Permalink: https://is.slu.cz/course/fpf/summer2019/UIDI009