2. Matematica
  3. Teaching
  4. Course Units

COMPUTABILITY THEORY

Matematica COMPUTABILITY THEORY

0512300026
DIPARTIMENTO DI MATEMATICA
MATHEMATICS
2015/2016

YEAR OF COURSE 3
YEAR OF DIDACTIC SYSTEM 2010
PRIMO SEMESTRE
CFUHOURSACTIVITY
648LESSONS
GIACOMO LENZI T Curriculum
Objectives
KNOWLEDGE OF BASIC TOPICS IN COMPUTABILITY THEORY.
KNOWLEDGE OF FORMAL LANGUAGE AND ABILITY IN PROBLEM-SOLVING.
Prerequisites
IT IS REQUIRED TO HAVE A CERTAIN MATHEMATICAL MATURITY WHICH CAN BE OBTAINED WITH TWO YEARS OF UNDERGRADUATE MATHEMATICS STUDIES.
Contents
IT IS EXPECTED TO COVER THE FOLLOWING TOPICS:
1) STRAIGHTEDGE AND COMPASS;
2) AUTOMATA;
3) RECURSIVE AND PRIMITIVE RECURSIVE FUNCTIONS;
4) RECURSIVE AND RECURSIVELY ENUMERABLE SETS.
Teaching Methods
TRADITIONAL
Verification of learning
ORAL EXAMINATION
Texts
THE MAIN REFERENCES WILL BE: THE LECTURE NOTES WRITTEN BY THE STUDENTS, THE BOOK BY G. GERLA "WHAT A COMPUTER CAN DO?" (IN ITALIAN), AND THE LECTURE NOTES ON COMPUTABILITY THEORY BY L. SPADA.
More Information
FOR FURTHER INFORMATION CONTACT THE TEACHER.
  BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2016-09-30]