# Computability and constructive mathematics, 7.5 ECTS

Second level## Facts

No available facts**Course code**MM8026

## Syllabus

## Description

The course covers fundamental constructibility issues in mathematics and gives an introduction to general constructive methods in mathematics.

Models for computations: Turing machines, register machines, lambda calculus. Universal machines and the halting problem. Rice´s theorem. Relative computability. Undecidability in group theory and number theory. Computable real numbers and elementary constructive analysis. Specker sequences. Recursive realizability. The Brouwer-Heyting-Kolmogorov interpretation of logic. Constructive logic and some brief type theory.

## Area of interests: Information only in Swedish

## Subject

### Mathematics

As a mathematical theory always implies that certain conclusions hold under certain given conditions, it can in principle say nothing about the physical reality. None the less mathematics has become an indispensable tool for a large number of subjects like astronomy, physics, chemistry, statistics and the technical sciences and in later times also for economy, biology, various social sciences and computor science. The role of mathematics in the applied sciences is both to supply notions for exact and adequate formulations of empirical laws but also from these laws to derive consequences, which can be used to find better models of the reality one has to describe. These tasks have lately become more important. Mathematics is in continual progress by intensive international research, new theories are created and already existing theories are simplified and augmented.