of intertwined perspectives such as numerical simulation, computability theory, computa- tional complexity, or analog computation. The last one understands ...

... computable model theory asked whether for a strongly minimal theory with one computable model, every countable model has an arithmetical copy. Relativizing ...

Nov 3, 2016 ... This highly interdisciplinary workshop brought together 51 Mathematicians from. Number Theory, Logic, Algebraic Geometry, Computability, ...

His current research interest is computability theory. Holger Teismann was ... the algebraic, computable, and constructible numbers. While all these ...

A partial function /:Z*^2^ is polynomial time computable if its domain. (denoted by Dom(/)) is in P and if there is a polynomial time bounded Turing machine M ...

Galeotti explained the interest of surreals in descriptive set theory and computable analysis. Lehericy presented his work on asymptotic couples, and Krapp on o ...

Considerations from computability theory [43] tell us that effective Cauchy rates are in general excluded, and one thus looks at an equivalent but ...