Related papers: A disturbing supertask
This paper proves the existence of a dichotomy which being formally derived from the topological successiveness of w-order leads to the same absurdity of Zeno's Dichotomy II. It also derives a contradictory result from the first Zeno's…
A coloration w of Z^2 is said to be coverable if there exists a rectangular block q such that w is covered with occurrences of q, possibly overlapping. In this case, q is a cover of w. A subshift is said to have the cover q if each of its…
In this paper, we study the sampling problem for first-order logic proposed recently by Wang et al. -- how to efficiently sample a model of a given first-order sentence on a finite domain? We extend their result for the…
We review the structure of W_\infty algebras, their super and topological extensions, and their contractions down to (super) w_\infty. Emphasis is put on the field theoretic realisations of these algebras. We also review the structure of…
We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. We prove that the time-complexity of the feasibility problem…
A countable group is residually finite if every nontrivial element can act nontrivially on a finite set. When a group fails to be residually finite, we might want to measure how drastically it fails - it could be that only finitely many…
In this paper, we examine the behavior of ideal-adic separatedness and completeness under certain ring extensions using trace map. Then we prove that adic completeness of a base ring is hereditary to its ring extension under reasonable…
In order to ensure the robust actuation of a plan, execution must be adaptable to unexpected situations in the world and to exogenous events. This is critical in domains in which committing to a wrong ordering of actions can cause the plan…
We give a new proof for Godel's second incompleteness theorem, based on Kolmogorov complexity, Chaitin's incompleteness theorem, and an argument that resembles the surprise examination paradox. We then go the other way around and suggest…
Consider a scheduling problem in which jobs need to be processed on a single machine. Each job has a weight and is composed of several operations belonging to different families. The machine needs to perform a setup between the processing…
In this paper, two new composition operations are defined among the order-preserving maps. They can act on order-preserving maps like the usual composition operation. They are coincide with the usual composition operation when the…
We describe a framework for proving consistency results about singular cardinals of arbitrary cofinality and their successors. This framework allows the construction of models in which the Singular Cardinals Hypothesis fails at a singular…
In comparing well-known CRDTs representing sets that can grow and shrink, we find caveats. In one, the removal of an element cannot be reliably undone. In another, undesirable states are attainable, such as when an element is present -1…
A finite W-algebra is an associative algebra constructed from a semisimple Lie algebra and its nilpotent element. In this survey we review recent developments in the representation theory of W-algebras. We emphasize various interactions…
We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…
The quest for optimal/stable paths in graphs has gained attention in a few practical or theoretical areas. To take part in this quest this chapter adopts an equilibrium-oriented approach that is abstract and general: it works with…
We establish the existence, uniqueness, and $W^{1,2,p}$-regularity of solutions to fully-nonlinear, parabolic obstacle problems when the obstacle is the pointwise supremum of functions in $W^{1,2,p}$ and the nonlinear operator is required…
Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements. Comparison-based computations can be naturally represented via the following…
Conformant planning is the problem of finding a sequence of actions for achieving a goal in the presence of uncertainty in the initial state or action effects. The problem has been approached as a path-finding problem in belief space where…
Groups, in which every subgroup containing some fixed primary cyclic subgroup has a complement, are investigated.