Results 11 to 20 of about 828,043 (333)
Probabilistic Recursion Theory and Implicit Computational Complexity [PDF]
Scientific Annals of Computer Science, 2014 We show that probabilistic computable functions, i.e., those func- tions outputting distributions and computed by probabilistic Turing machines, can be characterized by a natural generalization of Church and Kleene’s partial recursive functions.
U. Dal Lago, S. Zuppiroli, M. Gabbrielli
doaj +1 more source
Nonequilibrium statistical mechanics and optimal prediction of partially-observed complex systems
New Journal of Physics, 2022 Only a subset of degrees of freedom are typically accessible or measurable in real-world systems. As a consequence, the proper setting for empirical modeling is that of partially-observed systems.
Adam Rupe +2 more
doaj +1 more source
Proof Compression and NP Versus PSPACE II: Addendum
Bulletin of the Section of Logic, 2022 In our previous work we proved the conjecture NP = PSPACE by advanced proof theoretic methods that combined Hudelmaier’s cut-free sequent calculus for minimal logic (HSC) with the horizontal compressing in the corresponding minimal Prawitz-style natural ...
Lew Gordeev, Edward Hermann Haeusler
doaj +1 more source
P Systems with Evolutional Communication and Division Rules
Axioms, 2021 A widely studied field in the framework of membrane computing is computational complexity theory. While some types of P systems are only capable of efficiently solving problems from the class P, adding one or more syntactic or semantic ingredients to ...
David Orellana-Martín +2 more
doaj +1 more source
Computational Creativity and Aesthetics with Algorithmic Information Theory
Entropy, 2021 We build an analysis based on the Algorithmic Information Theory of computational creativity and extend it to revisit computational aesthetics, thereby, improving on the existing efforts of its formulation.
Tiasa Mondol, Daniel G. Brown
doaj +1 more source
A Computational Turn in Policy Process Studies: Coevolving Network Dynamics of Policy Change
Complexity, 2022 The past three decades of policy process studies have seen the emergence of a clear intellectual lineage with regard to complexity. Implicitly or explicitly, scholars have employed complexity theory to examine the intricate dynamics of collective action ...
Maxime Stauffer +5 more
doaj +1 more source
Study of blockchain's consensus mechanism based on score
IET Blockchain, 2021 The consensus mechanism is a key technology to achieve state consistency among distributed nodes and it determines the consensus efficiency and stability of the blockchain system.
Shaobin Cai +3 more
doaj +1 more source
Boundaries of computational complexity and optimal cluster’s quantity for controlled swarm in non-cooperative games [PDF]
Известия высших учебных заведений: Прикладная нелинейная динамика, 2021 The purpose of the work is to determine the relationship between the computational complexity of controlling a swarm of particles and the available computational resources for choosing the optimal control strategy.
Kiselev, Oleg Михайлович
doaj +1 more source
Diameter constrained reliability of ladders and Spanish fans [PDF]
Yugoslav Journal of Operations Research, 2016 We are given a graph G = (V, E), terminal set K V and diameter d > 0. Links fail stochastically and independently with known probabilities. The diameter-constrained reliability (DCR for short), is the probability that the K-diameter is not ...
Cancela Héctor +3 more
doaj +1 more source
Bosons vs. Fermions – A computational complexity perspective [PDF]
Revista Brasileira de Ensino de FísicaRecent years have seen a flurry of activity in the fields of quantum computing and quantum complexity theory, which aim to understand the computational capabilities of quantum systems by applying the toolbox of computational complexity theory. This paper
Daniel Jost Brod
doaj +2 more sources