Suchergebnisse - Computational Complexity and Algorithmic Information Theory

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory

Autoren: Gürpιnar, Emirhan Romashchenko, Andrei Exact Computing (LIRMM et al.

Weitere Verfasser: Gürpιnar, Emirhan Romashchenko, Andrei Exact Computing (LIRMM et al.

Quelle: ISSN: 1942-3454.

Schlagwörter: Expander mixing lemma, Finite geometry, Communication complexity, Kolmogorov complexity, Mutual information, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Relation: https://doi.org/10.4230/lipics.mfcs.2020.44; info:eu-repo/semantics/altIdentifier/arxiv/2004.13411; ARXIV: 2004.13411

Verfügbarkeit: https://hal-lirmm.ccsd.cnrs.fr/lirmm-02558566
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02558566v2/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02558566v2/file/2004.13411v5.pdf
https://doi.org/10.1145/3665163

Computable model discovery and high-level-programming approximations to algorithmic complexity

Autoren: V. Lemus Eduardo Acuña-Yeomans V. Zamora et al.

Quelle: Theoretical Computer Science. 927:31-41

Schlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Artificial intelligence, Generative grammar, Computer Science - Information Theory, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Turing machine, Computational Complexity and Algorithmic Information Theory, Causal Discovery, Theoretical computer science, Artificial Intelligence, Theory and Applications of Cellular Automata, 0202 electrical engineering, electronic engineering, information engineering, Universal Turing machine, Computability, Information Theory (cs.IT), Complex Systems, Computer science, Logic in Computer Science (cs.LO), Programming language, Computational Theory and Mathematics, Application of Genetic Programming in Machine Learning, Computer Science, Physical Sciences, Computation, Computational Depth

Zugangs-URL: http://arxiv.org/abs/2112.12197

An Operational Characterization of Mutual Information in Algorithmic Information Theory

Autoren: Andrei Romashchenko Marius Zimand Andrei Romashchenko and Marius Zimand

Weitere Verfasser: Andrei Romashchenko Marius Zimand Andrei Romashchenko and Marius Zimand

Quelle: Journal of the ACM. 66:1-42

Schlagwörter: FOS: Computer and information sciences, Computer Science - Information Theory, Information Theory (cs.IT), Kolmogorov complexity, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 16. Peace & justice, 01 natural sciences, secret key agreement, Computer Science - Computational Complexity, 0202 electrical engineering, electronic engineering, information engineering, communication complexity, ddc:004, mutual information

Dateibeschreibung: application/pdf

Zugangs-URL: https://dl.acm.org/doi/pdf/10.1145/3356867
http://arxiv.org/abs/1710.05984
https://dblp.uni-trier.de/db/conf/icalp/icalp2018.html#RomashchenkoZ18
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01618559
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01618559/document
https://dblp.uni-trier.de/db/journals/corr/corr1710.html#abs-1710-05984
https://dl.acm.org/doi/10.1145/3356867
https://dl.acm.org/doi/pdf/10.1145/3356867
https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=202002284445195317
https://doi.org/10.1145/3356867
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02297056
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.95

A circuit complexity formulation of algorithmic information theory

Autoren: Wyeth, Cole Sturtivant, Carl

Quelle: Physica D: Nonlinear Phenomena. 456:133925

Schlagwörter: FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Science - Computational Complexity, Computational Complexity (cs.CC), Machine Learning (cs.LG)

Zugangs-URL: http://arxiv.org/abs/2306.14087

Φ-Field Completion of Kolmogorov Complexity: Consciousness-Enhanced Universal Information Compression

Autoren: Rodgers, Jeremy

Schlagwörter: Φ-Field theory, Kolmogorov complexity, Descriptional complexity, Algorithmic information theory, Universal compression, Hypercomputation, Incomputability, Recursive systems, Information-theoretic compression, Computational complexity, Consciousness-enhanced computation, Pattern recognition, Recursive information organization, Information structure detection, Universal patterns, Cognitive computation, Consciousness and information theory

Low Complexity, Low Probability Patterns and Consequences for Algorithmic Probability Applications

Autoren: Mohammad Alaskandarani Kamaludin Dingle

Quelle: Complexity, Vol 2023 (2023)

Schlagwörter: FOS: Computer and information sciences, Multidisciplinary, General Computer Science, Computer Science - Information Theory, Information Theory (cs.IT), Probability (math.PR), QA75.5-76.95, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Electronic computers. Computer science, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Probability, probability_and_statistics

Dateibeschreibung: text/xhtml; application/pdf

Zugangs-URL: http://arxiv.org/abs/2207.12251
https://doaj.org/article/07883147fc1e448fa69720a895e521e5

Computational Creativity and Aesthetics with Algorithmic Information Theory

Autoren: Tiasa Mondol Daniel G. Brown

Quelle: Entropy, Vol 23, Iss 12, p 1654 (2021)

Schlagwörter: computational creativity, computational aesthetics, algorithmic information theory, Kolmogorov complexity, typicality novelty and value, computational complexity, Science, Astrophysics, QB460-466, Physics, QC1-999

Dateibeschreibung: electronic resource

Relation: https://www.mdpi.com/1099-4300/23/12/1654; https://doaj.org/toc/1099-4300

Zugangs-URL: https://doaj.org/article/b8083944d0d74ee0b407167e5d76eef3

Regression and Algorithmic Information Theory

Autoren: Epstein, Samuel

Schlagwörter: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computational Complexity (cs.CC)

Zugangs-URL: http://arxiv.org/abs/2304.07825

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory

Autoren: Gürpınar, Emirhan Romashchenko, Andrei Systèmes complexes, automates et pavages (ESCAPE) et al.

Weitere Verfasser: Gürpınar, Emirhan Romashchenko, Andrei Systèmes complexes, automates et pavages (ESCAPE) et al.

Quelle: 45th International Symposium on Mathematical Foundations of Computer Science
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02558566
45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic
http://mfcs.mff.cuni.cz/2020/

Schlagwörter: Kolmogorov complexity, Mutual information, Communication complexity, Expander mixing lemma, Finite geometry, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Geographisches Schlagwort: Prague, Czech Republic

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2004.13411; lirmm-02558566; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02558566; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02558566/document; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02558566/file/2004.13411.pdf; ARXIV: 2004.13411

Verfügbarkeit: https://hal-lirmm.ccsd.cnrs.fr/lirmm-02558566
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02558566/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02558566/file/2004.13411.pdf

Optimal oracles for point-to-set principles.

Autoren: Stull, D. M.¹ (AUTHOR) dmstull@uchicago.edu

Quelle: Journal of Mathematical Logic. Nov2025, p1. 44p.

Schlagwörter: *DIMENSION theory (Topology), *FRACTALS, *COMPUTATIONAL complexity, *HAUSDORFF spaces

Computational Analysis: Unveiling the Quantum Algorithms for Protein Analysis and Predictions

Autoren: S. Bhuvaneswari R Deepakraj Shabana Urooj et al.

Quelle: IEEE Access, Vol 11, Pp 94023-94033 (2023)

Schlagwörter: Grover's algorithm, Quantum Computation, Parallel computing, Adiabatic Quantum Computation, Bioinformatics, Quantum mechanics, Quantum, Computational Complexity and Algorithmic Information Theory, Identification (biology), Artificial Intelligence, Quantum Computing and Simulation, Biochemistry, Genetics and Molecular Biology, Field (mathematics), Quantum computer, FOS: Mathematics, Genetics, protein structure, protein-protein interaction (PPI), quantum algorithms, Molecular Biology, Biology, quantum simulation, Parallelism (grammar), Quantum Machine Learning, Fault-tolerant Quantum Computation, Prediction of Protein Subcellular Localization, Physics, Pure mathematics, Botany, Life Sciences, Computer science, TK1-9971, Algorithm, Protein–protein interaction, Computational Theory and Mathematics, FOS: Biological sciences, Computer Science, Physical Sciences, Quantum algorithm, Quantum Information, Protein Interaction Networks, Electrical engineering. Electronics. Nuclear engineering, Mathematics

Zugangs-URL: https://doaj.org/article/2b0d1e7f293d43bbaf1171fcc6ab0689

Algorithmic Information Theory and Computational Complexity

Autoren: Rūsiņš Freivalds

Quelle: Lecture Notes in Computer Science ISBN: 9783642449574

Zugangs-URL: https://rd.springer.com/chapter/10.1007/978-3-642-44958-1_11
https://link.springer.com/chapter/10.1007%2F978-3-642-44958-1_11
https://dblp.uni-trier.de/db/conf/birthday/solomonoff2011.html#Freivalds11

Algebraic Barriers to Halving Algorithmic Information Quantities in Correlated Strings

Autoren: Romashchenko, Andrei Exact Computing (LIRMM Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) et al.

Weitere Verfasser: Romashchenko, Andrei Exact Computing (LIRMM Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) et al.

Quelle: 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025)
https://hal-lirmm.ccsd.cnrs.fr/lirmm-05041918
50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), Aug 2025, Warsaw (POLAND), Poland. pp.84:1-84:18, ⟨10.4230/LIPIcs.MFCS.2025.84⟩

Schlagwörter: Mathematics of computing → Information theory, discrete geometry, communication complexity, Theory of computation → Communication complexity, algorithmic information theory, Kolmogorov complexity, Security and privacy → Information-theoretic techniques, Mathematics of computing → Combinatoric problems, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Geographisches Schlagwort: Warsaw (POLAND), Poland

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2504.14408; ARXIV: 2504.14408

Verfügbarkeit: https://hal-lirmm.ccsd.cnrs.fr/lirmm-05041918
https://doi.org/10.4230/LIPIcs.MFCS.2025.84

Distributed Compression through the Lens of Algorithmic Information Theory: A Primer

Autoren: Zimand, Marius

Quelle: Mathematics Almost Everywhere ISBN: 9789813237308

Schlagwörter: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Information Theory, Information Theory (cs.IT), 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences

Zugangs-URL: http://arxiv.org/pdf/1706.08468
http://arxiv.org/abs/1706.08468

Universal consistency of the k-NN rule in metric spaces and Nagata dimension. II

Autoren: Sushma Kumari Vladimir Pestov

Quelle: ESAIM: Probability and Statistics. 28:132-160

Schlagwörter: FOS: Computer and information sciences, Computer Science - Machine Learning, Metric (unit), Learning and Inference in Bayesian Networks, Economics, Separable space, Space (punctuation), Mathematical analysis, Metric Spaces, Machine Learning (cs.LG), Computational Complexity and Algorithmic Information Theory, Artificial Intelligence, Euclidean space, FOS: Mathematics, Active Learning in Machine Learning Research, Pure mathematics, Discrete mathematics, Minkowski–Bouligand dimension, Computer science, Packing dimension, Operating system, Dimension (graph theory), Operations management, Computational Theory and Mathematics, Computer Science, Physical Sciences, Metric space, Fractal dimension, Fractal, 62H30, 54F45, Mathematics, Consistency (knowledge bases)

Zugangs-URL: http://arxiv.org/abs/2305.17282

A statistical mechanical interpretation of algorithmic information theory III: Composite systems and fixed points

Autoren: Kohtaro Tadaki

Quelle: 2009 IEEE Information Theory Workshop. :354-358

Schlagwörter: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Information Theory, Information Theory (cs.IT), Probability (math.PR), FOS: Mathematics, 0102 computer and information sciences, Computational Complexity (cs.CC), 0101 mathematics, 01 natural sciences, Mathematics - Probability

Zugangs-URL: http://arxiv.org/pdf/0904.0973
http://arxiv.org/abs/0904.0973
https://dblp.uni-trier.de/db/journals/corr/corr0904.html#abs-0904-0973
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005351416
https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/358tadaki.pdf
http://ui.adsabs.harvard.edu/abs/2009arXiv0904.0973T/abstract
https://arxiv.org/abs/0904.0973

Design of a Vending Machine Using Verilog HDL and Implementation in Genus & Encounter

Autoren: Mahamudul Hassan Fuad Rahbaar Yeassin K. M. Mehedi Hassan et al.

Quelle: European Journal of Electrical Engineering and Computer Science. 7:88-95

Schlagwörter: Genus, Text Compression and Indexing Algorithms, Automata Theory and Formal Languages, Computer hardware, Computer science, 7. Clean energy, Verilog, Programming language, Field-programmable gate array, Computational Complexity and Algorithmic Information Theory, Computational Theory and Mathematics, Artificial Intelligence, FOS: Biological sciences, Computer Science, Physical Sciences, String Matching, Biology, Zoology

Positive affirmation of non-algorithmic information processing

Autoren: Carlos Eduardo Maldonado Maldonado, Carlos Eduardo [0000-0002-9262-8879]

Weitere Verfasser: Carlos Eduardo Maldonado Maldonado, Carlos Eduardo [0000-0002-9262-8879]

Quelle: Repositorio U. El Bosque
Universidad El Bosque
instacron:Universidad El Bosque
Cinta de moebio, Issue: 60, Pages: 279-285, Published: DEC 2017

Schlagwörter: Cognitive science, life, information, Artificial intelligence, Biología, Foundations of Quantum Mechanics and Interpretations, FOS: Physical sciences, Epistemology, 0102 computer and information sciences, 01 natural sciences, Non-algorithmic, Computational Complexity and Algorithmic Information Theory, Living systems, Procesamiento de la información, Artificial Intelligence, Quantum Computing and Simulation, Information processing, Cognitive psychology, 0103 physical sciences, Psychology, non-algorithmic, complexity science, Biological hypercomputation, Computability, biological hypercomputation, Adaptation (eye), Computer science, Nonlinear Sciences - Adaptation and Self-Organizing Systems, Atomic and Molecular Physics, and Optics, Process (computing), FOS: Philosophy, ethics and religion, FOS: Psychology, Philosophy, Operating system, Complexity science, Computational Theory and Mathematics, Physics and Astronomy, Computer Science, Physical Sciences, Ciencias de la vida, Adaptation and Self-Organizing Systems (nlin.AO), Neuroscience

Dateibeschreibung: application/pdf; text/html

Zugangs-URL: https://scielo.conicyt.cl/pdf/cmoebio/n60/0717-554X-cmoebio-60-00279.pdf
http://arxiv.org/abs/1704.06154
https://avancesveterinaria.uchile.cl/index.php/CDM/article/download/47789/50163
https://www.revistamad.uchile.cl/index.php/CDM/article/view/47789
https://revistaestudiosarabes.uchile.cl/index.php/CDM/article/download/47789/50163
https://semanariorepublicano.uchile.cl/index.php/CDM/article/download/47789/50163
https://revistaderechopublico.uchile.cl/index.php/CDM/article/view/47789
https://cintademoebio.uchile.cl/index.php/CDM/article/download/47789/50163
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0717-554X2017000300279&lng=en&tlng=en

Kolmogorov's legacy: Algorithmic Theory of Informatics and Kolmogorov Programmable Technology

Autoren: Sergei Levashkin V. V. Alexandrov Adolfo Guzmán-Arenas

Schlagwörter: FOS: Computer and information sciences, Cognitive science, K.2, Informatics, F.2, G.2, Kolmogorov complexity, 01 natural sciences, Mathematical analysis, 03 medical and health sciences, Computational Complexity and Algorithmic Information Theory, 0302 clinical medicine, Engineering, Differential equation, Artificial Intelligence, Theory and Applications of Cellular Automata, FOS: Mathematics, Psychology, Kolmogorov equations (Markov jump process), Differential algebraic equation, 0101 mathematics, Computability, Computer Science - General Literature, General Literature (cs.GL), Computer science, FOS: Psychology, Algorithm, Computational Theory and Mathematics, A.1, Electrical engineering, Computer Science, Physical Sciences, Kolmogorov Complexity, 01-02, 68-03, 68Qxx, 68Rxx, 68Txx, 68Uxx, 68Vxx, 68Wxx, 94-03, 94Axx, Program Analysis and Verification Techniques, Mathematics, Ordinary differential equation

Zugangs-URL: http://arxiv.org/abs/2006.11842

Symbolic Entropy and Conditional Contradictions in P vs NP via Parity CNFs

Autoren: Fathi, Kevin orcid:0009-0001-5546-

Schlagwörter: P vs NP, Boolean satisfiability, Kolmogorov complexity, Incompressible strings, Compression barrier, Self-reducibility, Diagonalization, Polynomial-time generator, NP-complete, Decision vs search, Complexity theory, Deterministic Turing machine, Nonuniformity barrier, Circuit lower bounds, Verifiers vs solvers, SAT problem, Computational complexity, Kolmogorov separation, Constructive vs nonconstructive, Algorithmic information theory

Relation: https://zenodo.org/records/16787163; oai:zenodo.org:16787163; https://doi.org/10.5281/zenodo.16787163

Verfügbarkeit: https://doi.org/10.5281/zenodo.16787163
https://zenodo.org/records/16787163