Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
We present exact and complete algorithms based on precomputed Sturm-Habicht sequences, discriminants and invariants, that classify, isolate with rational points and compare the re...
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
Abstract. We introduce a new mixed method for linear elasticity. The novelty is a simplicial element for the approximate stress. For every positive integer k, the row-wise divergen...
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...