Searching…
since its constructivity is also a kind of computability: thus it can be viewed as a particularly sophisticated kind of programming language, and in this ...
A. S. Marks, Uniformity, universality, and computability theory. J. Math. Log. 17. (2017), no. 1. [40]. A. Marks and S. Unger, Borel circle squaring. Ann. of ...
[9] Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New. York, 1967. The axiomatic derivation of absolute lower bounds.
Jan 26, 2015 ... arbitrary fiber squares as independent squares, and computability on relatively simple spaces, such as toric varieties. In future work, we ...
of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, pp. 125-133 (2005). [20] ...
The halting problem. In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an ...
Bloch, Algebraic K-theory and classfield theory for arithmetic surfaces., Annals of Math ... fact not only theoretical results about algorithmic computability of ...
Her talk also went over connections with computability and Borel combinatorics. At the applied end of set theory, we had talks about the current developments.
Typi- cally, the strength of variants of the infinite Ramsey theorem is precisely calibrated from the viewpoints of computability and proof theory.
Considerations from computability theory [43] tell us that effective Cauchy rates are in general excluded, and one thus looks at an equivalent but ...