COURSE PROGRAMME

1. Information about the programme

1.1 University
1.2 Faculty
1.3 Department
1.4 Domain
1.5 Cycle
1.6 Programme / Qualification

University Alexandru Ioan Cuza of Iai

Faculty of Mathematics
Mathematics
Mathematics
Master
Mathematics applied in finance and informatics

2. Information about the course

2.1 Course Name
2.2 Course taught by
2.3 Seminary / laboratory taught by
2.4 Year
2.5 Semester

Mathematical Foundations of calculability

Conf. dr. Dnu Rusu
Conf. dr. Dnu Rusu
2.6 Type of evaluation
2.7 Course type

OP

* OB Obligatory / OP Optionally / F Facultative

3. Total Hours (estimated per semester and activities)

3.1 Number of hours per week
3.2
course
4
2
3.4 Total number of hours
3.5
course
56
28
Distribution
Individual study using textbooks, course notes, bibliography items, etc.
Supplimentary study (library, on-line platforms, etc.)
Individual study for seminary/laboratory, homeworks, projects, etc.
Tutoring
Examination
Other activities...................................
3.7 Total hours of individual activity
3.8 Total hours per semester
3.9 Credit points

3.3. seminary/laboratory
3.6. seminary/laboratory

2
28
hours
120
10
20
4
180
210
7

4. Pre-requisites
4.1 Curriculum
4.2 Competencies

Natural numbers, Real numbers, Cardinal numbers, Metric

spaces, General topology
Working with the basics of algebra

5. Conditions (if necessary)

5.1 Course

amphitheater / classroom

5.2 Seminary / Laboratory

classroom

Transversal
competencies

Professional
competencies

6. Specific competencies acquired

C1 Manipulating notions, methods and mathematical models, specific techniques and technologies in
scientific calculus and applications in economy and informatics: 2 credits
C2 Data processing, analysis and interpretation using mathematical, statistical and informatics tools
C3 Being able to develop, test and validate algorithms; implementation in high level programing
languages
C4 Being able to construct and apply mathematical models for analyzing and simulating some
phenomena and processes: 2 credits
C5 Being able to develop, analyze and test computer systems and specific programming languages;
being able to use them for solving problems in applied mathematics: 1 credit
C6 Being able to analyze and interpret some economic processes and phenomena
CT1 Having a responsible attitude towards scientific research and teaching, being able to fully
develop the personal potential in the professional career, respecting the principles of a rigorous and
efficient work in order to fulfill complex tasks, respecting the ethical norms and principles in the
professional activity: 1 credit
CT2 Being able to work efficiently in a team and to coordinate and efficiently lead a team or an interdisciplinary group
CT3 Being able to make a selection of information resources and to use them efficiently, in Romanian
or other language of international circulation, in order to develop the professional activity and adapt it
to the demands of a dynamical society: 1 credit

7.1. General
objective

Students will become familiar with the concepts of computability and computable function, since
Turing computable functions and recursive functions and ending with the definition and study these
concepts in the abstract of the effectively given domains. Special emphasis will be placed on
concrete situations: calculability on real line, calculability on complete metric spaces and calculability
on Banach spaces.

7.2. Specific objectives

7. Course objectives

If successfull at the final examination, students will be able to:

Describe the basic objects of recursive function theory and the domain theory
Demonstrate their basic properties
Explain the meaning and applications of the main results
Use some basic techniques and concepts and problem solving exercises
Calculate primitive recursive functions, real numbers based on various models of construction, etc.

8. Contents
8.1

1.

2.

Course
Computable functions (Turing
machine, Turing computable functions)
Recursive functions (primitive
recursive functions, recursive functions,
partial recursive functions, Church's
thesis)
Recursively enumerable sets
(recursive sets, recursively enumerable
sets, encodings of the plan)

Teaching methods

Remarks

Exposure, conversation,
demonstration,
problematizing

2 hours
[3,4]

Exposure, conversation,
demonstration,
problematizing

2 hours
[3,4]

(number oh hours, references)

3.

4.

5.

6.

7.

8.

9.

10.

11.

12.

13.

14.

Notions and preliminary results

(dcpo, ccpo, complete lattice,
equivalent conditions, closure systems,
the set of formal balls associated with a
metric space)
Scott-continuous functions
(definition, examples, the Scottcontinuous functions, isomorphism of
dcpo)
Fixed point theorems (Tarski's
theorem, Markowskys theorem, fixed
point theorem for Scott-continuous
functions, applications)
Approximation order (definition,
properties, base in a dcpo, the lowest
base, property of interpolation,
continuous domains, algebraic
domains)
Continuous domains (characterization
theorems, abstract bases, continuous
domain of the ideals over an abstract
basis, isomorphism theorems, role of
the basis in building of domains and
Scott-continuous functions)
Scott topology (elements of general
topology, specialized preorder,
Alexandrov topology, Scott-open sets
and Scott-closed sets, Scott topology,
Scott continuity as a topological
continuity, Scott topology on continuous
domains)
Cartesian product of domains
Lattice domains (L-domains, bcdomains, continuous lattices, Scott
domains)
Effectively given domains
(computable elements, computable
sequences, computable functions
between effectively given domains)
Computability on the real line (the
effective domain of intervals,
computable numbers, effective
convergence, computable real
functions)
Computability on metric spaces
(effective metric spaces, computable
functions between effective metric
spaces)
Computability on Banach spaces
(effective Banach spaces, computable
linear operators)

Exposure, conversation,
demonstration,
problematizing

2 hours
[1]

Exposure, conversation,
demonstration,
problematizing

2 hours
[1]

Exposure, conversation,
demonstration,
problematizing

2 hours
[1]

Exposure, conversation,
demonstration,
problematizing

2 hours
[1]

Exposure, conversation,
demonstration,
problematizing

2 hours
[1]

Exposure, conversation,
demonstration,
problematizing

2 hours
[1,2,5]

Exposure, conversation,
demonstration,
problematizing
Exposure, conversation,
demonstration,
problematizing

2 hours
[1]
2 hours
[1]

Exposure, conversation,
demonstration,
problematizing

2 hours
[1,2]

Exposure, conversation,
demonstration,
problematizing

2 hours
[1,2,6]

Exposure, conversation,
demonstration,
problematizing

2 hours
[1,2,6]

Exposure, conversation,
demonstration,
problematizing

2 hours
[1,2,6]

Bibliography
Main references:
[1] S.Abramsky, A.Jung, Domain Theory, Clarendon Press, Oxford,
http://www.cs.bham.ac.uk/~axj/pub/papers/handy1.pdf.
[2] G.Gierz, K.H.Hofmann, K.Keimel, J.D.Lawson, M.Mislove, D.S.Scott, Continuous Lattices and Domains,
Cambridge University Press 2003.
[3] P.Odifreddi, Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers, Studies
in Logic and Foundations of Mathematics, vol. 125, Elsevier 1992.
Other references:
[4] H.Rogers, Theory of Recursive Functions and Effective Computability, Mc-Graw Hill, New York, 1967.
[5] O. Costinescu, Elemente de topologie general, Editura tehnic, 1969.
[6] A.Edalat, P.Snderhauf, A Domain-theoretic Approach to Real Number Computation, Theoretical
Computer Science, 210, (1998).
8.2
1.

2.

3.

4.

5.

6.

7.

8.

Seminary / Laboratory
Examples of primitive recursive
functions
Study of Ackermann's function
Examples of recursive and recursively
enumerable sets
Operations with recursive and
recursively enumerable sets
Study of Cantor's pair function
Examples of dcpo, ccpo, etc.
Organizing a complete metric space as
a dcpo
Examples of Scott-continuous functions
Scott-continuous function associated
with a contraction
Applications of Tarski's theorem
Applications of Markowskys theorem
Applications of fixed point theorem for
Scott-continuous functions
Approximation order for various
concrete dcpo
Approximation order in the dcpo of
formal balls associated with a complete
metric space
Examples of algebraic domains,
continuous non-algebraic domains, etc
The continuous non-algebraic domain
of formal balls associated with a
complete metric space. The form of this
domain for a Banach space and the set
of real numbers.
Comparison between Scott topology
and Alexandrov topology associated
with the order relation
Various characterizations of the case of
equality. Concrete examples
Scott topology of continuous domain of
formal balls in a complete metric space

Teaching methods

Remarks

Exercise conversation

2 hours
[3,4]

Exercise conversation

2 hours
[3,4]

Exercise conversation

2 hours
[1,2,8]

Exercise conversation

2 hours
[1,2,8]

Exercise conversation

2 hours
[1]

Exercise conversation

2 hours
[1,2,8]

Exercise conversation

2 hours
[1,2,8]

Exercise conversation

2 hours
[1,2,5,8]

(number oh hours, references)

Study invariant properties relative to the

cartesian product
9.
Characterization of Scott continuity of
the functions with two variables.
Examples of L-domains which are not
bc-domains
Examples of bc-domains which are not
10.
continuous lattices
Construction of new continuous
domains using the cartesian product
Examples of effectively given domains
An algorithm for the construction of a
11.
enumeration of the computable
elements in a effectively given domain
Study effectively given domain of
intervals
12.
Applying the general theory on this
particular example
Domain of formal balls as an effectively
13.
given domain
Operations with computable elements
Examples of effective Banach spaces
14.
and computable linear operators
References

Exercise conversation

2 hours
[1,2]

Exercise conversation

2 hours
[1,2]

Exercise conversation

2 hours
[1,6]

Exercise conversation

2 hours
[1,6]

Exercise conversation

2 hours
[1,6]

Exercise conversation

2 hours
[1,7]

[1] S.Abramsky, A.Jung, Domain Theory, Clarendon Press, Oxford,

http://www.cs.bham.ac.uk/~axj/pub/papers/handy1.pdf.
[2] G.Gierz, K.H.Hofmann, K.Keimel, J.D.Lawson, M.Mislove, D.S.Scott, Continuous Lattices and Domains,
Cambridge University Press 2003.
[3] P.Odifreddi, Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers, Studies
in Logic and Foundations of Mathematics, vol. 125, Elsevier 1992.
[4] H.Rogers, Theory of Recursive Functions and Effective Computability, Mc-Graw Hill, New York, 1967.
[5] O. Costinescu, Elemente de topologie general, Editura tehnic, 1969.
[6] A.Edalat, P.Snderhauf, A Domain-theoretic Approach to Real Number Computation, Theoretical
Computer Science, 210, (1998).
[7] A.Edalat, P.Snderhauf, Computable Banach spaces via domain theory, Theoretical Computer Science,
219, (1999).
[8] A.Precupanu, L.Florescu, G.Blendea, M.Cuciureanu, Spaii metrice. Probleme, Univ. A.I.Cuza Iai,
1990.

9. Coordination of the contents with the expectations of the community representatives, professional
associations and relevant employers in the corresponding domain
The current epoch is an epoch of computation. The computation is found in all electronic devices that
surround us and improve our lives. Nowadays more and more electrical devices are controlled by
microprocessor and default behavior performs computations in their activity. The first is of course the
computers, which by virtue of communication and mobility have taken a variety of forms and features, and pc
became laptop, tablet, smartphone, navigation system, etc. We continue with domestic robots, smart TVs ,
and so on, until the encapsulated systems, equipped with dedicated microprocessor that performs specific
functions. But computational activity is not conducted only at the functional level but is found in all forms of
design.So, without be visible, the computation surrounds us in a large variety of forms.
During the course and the seminar the students will familiarize with the mathematical theories of calculability,
i.e. recursive function theory and the domain theory.

10. Assessment and examination

Activity

10.4 Course

10.5 Seminary/
Laboratory

10.1 Criteria
Knowledge and use of the
fundamental concepts and
results, applying of the
theoretical results
Identify of the methods for
solving of exercises and
problems, acquiring of
computational skills, the
ability to understand and
present a text in discipline
issues

10.2 Modes

10.3 Weight in the

final grade (%)

written exam

50

written exam
making and presenting a
report

50

10.6 Minimal requirements

- Knowledge of fundamental concepts, understanding the main results
- Solving of problems and exercises with low-difficulty
- Realization and exposure of a low-difficulty report

Date

Course coordinator
Conf. dr. Dnu Rusu

Aproval date in the department

Seminary coordinator
Conf. dr. Dnu Rusu

Head of the departament

Prof. Rzvan Licanu, Ph. D.