Traditionally, the development of computing systems has been focused on performance improvements driven by the demand of applications from consumer, scientific, and business domai...
Anton Beloglazov, Rajkumar Buyya, Young Choon Lee,...
We formalize the construction of Paterson’s variant of the Ajtai–Koml´os–Szemer´edi sorting network of logarithmic depth in the bounded arithmetical theory VNC1 ∗ (an ex...
We describe strongly minimal theories Tn with finite languages such that in the chain of countable models of Tn, only the first n models have recursive presentations. Also, we d...
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
For analytic functions in the open unit disk, J. Becker (Math. Ann. 202(1973)) has given some univalent conditions. In the present paper, some extensions of Becker’s type are co...