English
Related papers

Related papers: Resource Limited Theories and their Extensions

200 papers

Resource theories play an important role in quantum information theory, as they identify resourceful states and channels that are potentially useful for the accomplishment of tasks that would be otherwise unreachable. The elementary…

Quantum Physics · Physics 2020-09-02 A. C. S. Costa , R. M. Angelo

From the perspective of the physics of complex systems (1) we deal with the current state of mod-ern physics including the crisis in physics demonstrated through its epistemological, psychological, economical as well as the social context;…

History and Philosophy of Physics · Physics 2021-10-06 Dragutin T. Mihailovic , Darko Kapor , Sinisa Crvenkovic , Anja Mihailovic

It is still common wisdom amongst economists, politicians and lay people that economic growth is a necessity of our social systems, at least to avoid distributional conflicts. This paper challenges such belief moving from a purely physical…

General Economics · Economics 2020-05-11 Angelo Tartaglia

It is generally agreed that there is matter in the universe and, in this paper, we show that the existence of matter is extremely problematic for the proposed Rh = ct universe. Considering a dark energy component with an equation of state…

Cosmology and Nongalactic Astrophysics · Physics 2015-06-15 Geraint F. Lewis

This paper investigates $\exists\mathbb{R}(r^{\mathbb{Z}})$, that is the extension of the existential theory of the reals by an additional unary predicate $r^{\mathbb{Z}}$ for the integer powers of a fixed computable real number $r > 0$. If…

Logic in Computer Science · Computer Science 2025-10-15 Jorge Gallego-Hernández , Alessio Mansutti

In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's…

Logic in Computer Science · Computer Science 2010-01-20 Thomas Ehrhard

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

Logic in Computer Science · Computer Science 2012-10-10 Domenico Cantone , Cristiano Longo

Non-linear renewal theory is extended to include random walks perturbed by both a slowly changing sequence and a stationary one. Main results include a version of the Key Renewal Theorem, a derivation of the limiting distribution of the…

Statistics Theory · Mathematics 2007-06-13 Dong-Yun Kim , Michael Woodroofe

We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A…

Logic · Mathematics 2020-09-22 Joel David Hamkins , Wojciech Aleksander Wołoszyn

While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…

Computational Complexity · Computer Science 2018-01-23 Akitoshi Kawamura , Martin Ziegler

We investigate when Taylor expansions can be used to prove the Runge-Gross Theorem, which is at the foundation of Time-Dependent Density Functional Theory (TDDFT). We start with a general analysis of the conditions for the Runge-Gross…

Mathematical Physics · Physics 2016-07-06 Søren Fournais , Jonas Lampart , Mathieu Lewin , Thomas Østergaard Sørensen

We prove three results on the dimension structure of complexity classes. 1. The Point-to-Set Principle, which has recently been used to prove several new theorems in fractal geometry, has resource-bounded instances. These instances…

Computational Complexity · Computer Science 2021-09-14 Jack H. Lutz , Neil Lutz , Elvira Mayordomo

We extend the standard reinforcement learning framework to random time horizons. While the classical setting typically assumes finite and deterministic or infinite runtimes of trajectories, we argue that multiple real-world applications…

Machine Learning · Computer Science 2025-08-15 Enric Ribera Borrell , Lorenz Richter , Christof Schütte

Tensor networks provide succinct representations of quantum many-body states and are an important computational tool for strongly correlated quantum systems. Their expressive and computational power is characterized by an underlying…

Conventional theoretical machine learning studies generally assume explicitly or implicitly that there are enough or even infinitely supplied computational resources. In real practice, however, computational resources are usually limited,…

Machine Learning · Computer Science 2024-08-27 Zhi-Hua Zhou

We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…

Logic · Mathematics 2020-07-21 Samuel M. Corson

In this paper we study possibilities of efficient reasoning in combinations of theories over possibly non-disjoint signatures. We first present a class of theory extensions (called local extensions) in which hierarchical reasoning is…

Logic in Computer Science · Computer Science 2008-10-16 Viorica Sofronie-Stokkermans

Resource theory is a general, model-independent approach aiming to understand the qualitative notion of resource quantitatively. In a given resource theory, free operations are physical processes that do not create the resource and are…

Quantum Physics · Physics 2020-04-09 Chung-Yun Hsieh

The reduced ring order (rr-order) is a natural partial order on a reduced ring $R$ given by $r\le_{\text{rr}} s$ if $r^2=rs$. It can be studied algebraically or topologically in rings of the form $\text{C}(X)$. The focus here is on those…

General Topology · Mathematics 2020-05-20 W. D. Burgess , R. Raphael

The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…