Matematica | COMPUTABILITY THEORY
Matematica COMPUTABILITY THEORY
cod. 0512300026
COMPUTABILITY THEORY
| 0512300026 | |
| DIPARTIMENTO DI MATEMATICA | |
| MATHEMATICS | |
| 2013/2014 |
| YEAR OF COURSE 3 | |
| YEAR OF DIDACTIC SYSTEM 2010 | |
| PRIMO SEMESTRE |
| SSD | CFU | HOURS | ACTIVITY | |
|---|---|---|---|---|
| MAT/01 | 6 | 48 | LESSONS |
| Objectives | |
|---|---|
| KNOWLEDGE OF BASIC TOPICS IN COMPUTABILITY THEORY. KNOWLEDGE OF FORMAL LANGUAGE AND ABILITY IN PROBLEM-SOLVING. |
| Prerequisites | |
|---|---|
| A CERTAIN MATHEMATICAL MATURITY IS REQUESTED, CORRESPONDING TO A COUPLE OF YEARS OF UNDERGRADUATE STUDIES IN MATHEMATICS. |
| Contents | |
|---|---|
| IT IS EXPECTED TO COVER THE FOLLOWING TOPICS: 1) RECURSIVE FUNCTIONS 2) NUMBERINGS 3) RECURSIVE AND RECURSIVELY ENUMERABLE SETS 4) GOEDEL THEOREMS 5) REDUCIBILITY AND DEGREES 6) RECURSION THEOREMS |
| Teaching Methods | |
|---|---|
| TRADITIONAL |
| Verification of learning | |
|---|---|
| ORAL EXAMINATION |
| Texts | |
|---|---|
| THE MAIN REFERENCES WILL BE THE LECTURE NOTES WRITTEN BY PROF. SPADA AND THE BOOK: N. CUTLAND, COMPUTABILITY, CAMBRIDGE UNIVERSITY PRESS. |
| More Information | |
|---|---|
| FOR MORE INFORMATION PLEASE CONTACT THE TEACHER. |
BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2016-09-30]
