349 search results - page 26 / 70 » The Finite and the Infinite |
83
Voted
APAL
2006
15 years 15 days ago
2006
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...
DLT
2006
15 years 1 months ago
2006
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...
102
Voted
SYNTHESE
2008
15 years 11 days ago
2008
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...
112
Voted
PODS
2004
ACM
16 years 17 days ago
2004
ACM
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...
98
Voted
STOC
2002
ACM
16 years 22 days ago
2002
ACM
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 ...