Results 111 to 120 of about 30,531 (141)
Some of the next articles are maybe not open access.
2023
Many people remember Lofti Zadeh's mantra -- that everything is a matter of degree. This was one of the main principles behind fuzzy logic. What is somewhat less remembered is that Zadeh also used another important principle -- that there is a need for simplicity.
Kreinovich, Vladik +2 more
openaire +1 more source
Many people remember Lofti Zadeh's mantra -- that everything is a matter of degree. This was one of the main principles behind fuzzy logic. What is somewhat less remembered is that Zadeh also used another important principle -- that there is a need for simplicity.
Kreinovich, Vladik +2 more
openaire +1 more source
Kolmogorov Complexity of Categories
Computation, Logic, Games, and Quantum Foundations, 2013Kolmogorov complexity theory is used to tell what the algorithmic informational content of a string is. It is defined as the length of the shortest program that describes the string.
N. Yanofsky
semanticscholar +1 more source
Comput. Biol. Medicine
BACKGROUND Heart failure remains a critical global health issue, contributing significantly to cardiovascular disease burden and accounting for approximately 17.8 million annual deaths worldwide.
Md Abrar Jahin +4 more
semanticscholar +1 more source
BACKGROUND Heart failure remains a critical global health issue, contributing significantly to cardiovascular disease burden and accounting for approximately 17.8 million annual deaths worldwide.
Md Abrar Jahin +4 more
semanticscholar +1 more source
Quantum circuit complexity and unsupervised machine learning of topological order
arXiv.orgInspired by the close relationship between Kolmogorov complexity and unsupervised machine learning, we explore quantum circuit complexity, an important concept in quantum computation and quantum information science, as a pivot to understand and to build ...
Yanming Che +3 more
semanticscholar +1 more source
A Meta-Complexity Characterization of Quantum Cryptography
Electron. Colloquium Comput. Complex.We prove the first meta-complexity characterization of a quantum cryptographic primitive. We show that one-way puzzles exist if and only if there is some quantum samplable distribution of binary strings over which it is hard to approximate Kolmogorov ...
Bruno Cavalar +3 more
semanticscholar +1 more source
Quantum Cryptography and Meta-Complexity
Annual International Cryptology ConferenceIn classical cryptography, one-way functions (OWFs) are the minimal assumption, while it is not the case in quantum cryptography. Several new primitives have been introduced such as pseudorandom state generators (PRSGs), one-way state generators (OWSGs),
Taiga Hiroka, T. Morimae
semanticscholar +1 more source
The Informational Birth of the Universe: A Theory of Everything from Quantum Complexity
Quantum ReportsWe propose a unified theoretical framework grounded in a Primordial Quantum Field (PQF)—a continuous, non-local informational substrate that precedes space-time and matter. The PQF is represented by a wave functional evolving in an abstract configuration
Gastón Sanglier Contreras +2 more
semanticscholar +1 more source
Quantum Observer and Kolmogorov Complexity
20131 Introduction2 Observer as a Problem3 Observer as a System Identification Algorithm4 Quantum and Classical Systems5 Elements of Reality6 Relativity of Observation7 Experimental Test8 ...
openaire +1 more source
Carleman-lattice-Boltzmann quantum circuit with matrix access oracles
The Physics of FluidsWe apply Carleman linearization of the Lattice Boltzmann (CLB) representation of fluid flows to quantum emulate the dynamics of a two-dimensional Kolmogorov-like flow.
Claudio Sanavio +4 more
semanticscholar +1 more source
Qubit complexity and the complexity of operators acting on the space of quantum states
Defense + Commercial Sensing, 2022A. Kaltchenko
semanticscholar +1 more source