Studying at the University of Verona
Here you can find information on the organisational aspects of the Programme, lecture timetables, learning activities and useful contact details for your time at the University, from enrolment to graduation.
Study Plan
This information is intended exclusively for students already enrolled in this course.If you are a new student interested in enrolling, you can find information about the course of study on the course page:
Laurea magistrale in Mathematics - Enrollment from 2025/2026The Study Plan includes all modules, teaching and learning activities that each student will need to undertake during their time at the University.
Please select your Study Plan based on your enrollment year.
1° Year
| Modules | Credits | TAF | SSD |
|---|
Un insegnamento a scelta tra i seguenti2° Year activated in the A.Y. 2010/2011
| Modules | Credits | TAF | SSD |
|---|
Due insegnamenti da 6 cfu ciascuno tra i seguenti, oppure quello non gia' scelto tra i due del i anno a scelta da 12 cfu| Modules | Credits | TAF | SSD |
|---|
Un insegnamento a scelta tra i seguenti| Modules | Credits | TAF | SSD |
|---|
Due insegnamenti da 6 cfu ciascuno tra i seguenti, oppure quello non gia' scelto tra i due del i anno a scelta da 12 cfu| Modules | Credits | TAF | SSD |
|---|
Uno tra i seguenti insegnamenti da 6 cfu ciascunoLegend | Type of training activity (TTA)
TAF (Type of Educational Activity) All courses and activities are classified into different types of educational activities, indicated by a letter.
Mathematics methods for computer science (2010/2011)
Teaching code
4S02855
Teacher
Coordinator
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
I semestre dal Oct 4, 2010 al Jan 31, 2011.
Learning outcomes
The course covers standard principles and methods in theoretical computer science, notably in automata theory and computability. The course is structured in two parts: in the first part we cover automata, regular languages, context-free grammars, normal forms and formal Chomsky's language hierarchy. In the second part we cover the notion of computable function, decidability, security and issues in the mathematical or recursion
The course requires the standard courses on Discrete mathematics and logic.
Program
Automata and formal languages (20h): Formal languages and grammars, finite state automata, regular languages, context-free languages, normal forms, Push-down automata, Chomsky classification of formal languages. Computability (25h): intuitive notion of algorithm, Turing analysis of computable functions, Turing machines and WHILE-programs, Church thesis, Goedelization, universality, Theorem s-m-n, unsolvable problems and halting problem, metaprogramming, recursive and recursive enumerable sets, Recursion theorems, Rice Theorem, reducibility, complete, creative and productive sets. Computational virology.
Examination Methods
Discussion of a cooperative project.
