Searching…
Typi- cally, the strength of variants of the infinite Ramsey theorem is precisely calibrated from the viewpoints of computability and proof theory.
since its constructivity is also a kind of computability: thus it can be viewed as ... It is in considering this question that the connection with homotopy theory ...
The halting problem. In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an ...
May 15, 2007 ... Algorithmic randomness and computability. Rodney G. Downey · DOI ... Representation theory and the cohomology of arithmetic groups. Birgit ...
Jan 26, 2015 ... arbitrary fiber squares as independent squares, and computability on relatively simple spaces, such as toric varieties. In future work, we ...
[9] Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New. York, 1967. The axiomatic derivation of absolute lower bounds.
of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, pp. 125-133 (2005). [20] ...
cluding graph theory, information theory, combinatorial optimization, polyhedral ... McCormick, Computability of global solutions to factorable nonconvex ...
computability of this limit, rates of convergence to the limit and so on and so forth. Although well documented, periodicity is still too much an idealized ...
Bloch, Algebraic K-theory and classfield theory for arithmetic surfaces., Annals of Math ... fact not only theoretical results about algorithmic computability of ...