Benjamin Seyfferth

According to our database, Benjamin Seyfferth authored at least 4 papers between 2009 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2013

On λ-Definable Functions on Ordinals.

Tim Fischbach, Benjamin Seyfferth

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

Tree Representations via Ordinal Machines.

Philipp Schlicht, Benjamin Seyfferth

Comput., 2012

Towards a Theory of Infinite Time Blum-Shub-Smale Machines.

Peter Koepke, Benjamin Seyfferth

Proceedings of the How the World Computes, 2012

2009

Ordinal machines and admissible recursion theory.

Peter Koepke, Benjamin Seyfferth

Ann. Pure Appl. Log., 2009