MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Analytic Machines and Computability of Analytic Functions

Tobias Gärtner
Max-Planck-Institut für Informatik - D1
Promotionskolloquium
AG 1  
AG Audience
English

Date, Time and Location

Thursday, 16 April 2009
14:00
30 Minutes
E1.3
HS 003
Saarbrücken

Abstract

Topic of the thesis is the theory of computability over the real and complex numbers.

For the definition of computable real und complex functions, the machine model of analytic machines is used. This is a register machine model that allows exact arithmetic and admits infinite converging computations. Results about properties of computable functions are presented.
The model is then applied to give a notion of computable complex-analytic (i.e., holomorphic) functions. The resulting class of functions is shown to have good natural properties, such as closure under composition, local inversion, and analytic continuation.

Contact

Tobias Gärtner
--email hidden
passcode not visible
logged in users only

Tags, Category, Keywords and additional notes

Computability, Real Numbers, Complex Numbers, Analytic Functions

Tobias Gärtner, 04/14/2009 10:42 -- Created document.