Dipl.-Math. Benjamin Seyfferth

Research profile

• Ordinal machine models
• Admissible recursion theory
• Descriptive set theory of ordinal machines
• Ordinal /lambda-calculus

Preprints

• with Peter Koepke, Ordinal machines and admissible recursion theory, Annals of Pure and Applied Logic 160:3, 2009 (Special issue "Computation and Logic in the Real World: CiE 2007"), 310 -- 318 pdf

Slides, abstracts and unpublished work

• Doing \alpha-Recursion Theory with Ordinal Machines, Slides for CiE 2007 pdf
• Ordinal Machines and \alpha-Recursion Theory, Diploma thesis, 2008 pdf
• with Bernhard Irrgang, Multitape Ordinal Machines and Primitive Recursion, unpublished pdf
• Multitape Ordinal Machines and Primitive Recursion, Slides for CiE 2008 pdf
• Characterizing \Delta^1_2 via Ordinal Machines, Slides for Greifswald 2010 pdf
• Computing the Shoenfield Tree, Slides for CiE 2010 pdf
• Tree Representations via Ordinal Machines, submitted to Computability pdf

Hausdorff Center for Mathematics

In parallel to my research, I work as Scientific Associate for the Hausdorff Center for Mathematics (HCM).

Contact information

Mathematisches Institut
Rheinische Friedrich-Wilhelms-Universität Bonn
Endenicher Allee 60
D-53115 Bonn
Germany

Office: Endenicher Allee 62, Office 0.001
Phone: +49 (0) 228 73-3138
E-mail : seyfferth (at math.uni-bonn.de)