| | Computable Analysis, Complexity, and Randomness
Iraj Kalantari
Western Illinois University, USA
| Abstract
| |
Computable mathematics is the pursuit and discovery of the effective
content of mathematics. Computability in analysis was one of the original
interests central to the theory of computability as per early work of Turing's.
Complexity is a natural intertwining pursuit in study of computability.
The concept of randomness surfaces in these pursuits.
In this course, we introduce the recent unifying filter-approach to the
topic of computable topology, apply it to computable analysis, and examine its success. We also study complexity and randomness, and the recent findings in these areas. The connection between these fields is examined and open questions presented.
|
Information |
| Time: | Monday, June 20, 2005 15:30-17:00
Wednesday, June 22, 2005 15:30-17:00
Saturday, June 25, 2005 15:30-17:00
Monday, June 27, 2005 15:30-17:00 |
| Place: | Lecture Hall, Niavaran Bldg., Niavaran Sqr., Tehran, Iran |
| | |
|
