We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
Wesley Calvert, Douglas Cenzer, Valentina S. Hariz...
Let be an alphabet of size t, let f : be a non-erasing morphism, let w be an infinite fixed point of f, and let E(w) be the critical exponent of w. We prove that if E(w) is fi...
A Zenonian supertask involving an infinite number of identical colliding balls is generalized to include balls with different masses. Under the restriction that the total mass of a...
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...