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 ...

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] ...

A basic feature of the theory of computability is the existence of a universal Turing machine U, which, if its input is a code M w, simulates M on input w ...

PRIN 2017-2017NWTM8R Mathematical Logic: models, sets, computability. Page 21. Set Theory. 99. Rigidity conjectures in continuous quotients. Alessandro Vignati.

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