المؤلفون: Iapăscurtă, V.

المصدر: Lecture Notes in Networks and Systems (Vol. 1090)

مصطلحات موضوعية: biomedical data, Block decomposition, Block decomposition method, Continuous biomedical data, data set, Decomposition methods, epilepsy, Kolmogorov-Chaitin complexity, machine-learning, Sepsi

وصف الملف: application/pdf

Relation: https://ibn.idsi.md/vizualizare_articol/211309

الاتاحة: https://ibn.idsi.md/vizualizare_articol/211309
https://doi.org/10.1007/978-3-031-67192-0_8

المؤلفون: Zenil, Hector, Hernández Orozco, Santiago, Kiani, Narsis, Soler Toscano, Fernando, Rueda Toicen, Antonio, Tegnér, Jesper

المساهمون: Universidad de Sevilla. Departamento de Filosofía y Lógica y Filosofía de la Ciencia, Swedish Research Council

مصطلحات موضوعية: Algorithmic randomness, Algorithmic probability, Kolmogorov–Chaitin complexity, Information theory, Shannon entropy, Information content, Thue–Morse sequence

Relation: Entropy, 20 (8); 2015-05299; http://dx.doi.org/10.3390/e20080605; https://idus.us.es/handle//11441/78763

الاتاحة: https://idus.us.es/handle//11441/78763

المؤلفون: Hector Zenil, Santiago Hernández-Orozco, Narsis A. Kiani, Fernando Soler-Toscano, Antonio Rueda-Toicen, Jesper Tegnér

المصدر: Entropy; Volume 20; Issue 8; Pages: 605

مصطلحات موضوعية: algorithmic randomness, algorithmic probability, Kolmogorov–Chaitin complexity, information theory, Shannon entropy, information content, Thue–Morse sequence, π

وصف الملف: application/pdf

Relation: Information Theory, Probability and Statistics; https://dx.doi.org/10.3390/e20080605

الاتاحة: https://doi.org/10.3390/e20080605

المؤلفون: Hector Zenil, Narsis A. Kiani, Jesper Tegnér

المصدر: Entropy; Volume 20; Issue 8; Pages: 551

مصطلحات موضوعية: algorithmic information theory, complex networks, Kolmogorov-Chaitin complexity, algorithmic randomness, algorithmic probability, biological networks

وصف الملف: application/pdf

Relation: Statistical Physics; https://dx.doi.org/10.3390/e20080551

الاتاحة: https://doi.org/10.3390/e20080551

المؤلفون: Hector Zenil, Narsis Kiani, Jesper Tegnér

المصدر: Entropy; Volume 20; Issue 7; Pages: 534

مصطلحات موضوعية: Kolmogorov–Chaitin complexity, algorithmic probability, algorithmic coding theorem, Turing machines, polyominoes, polyhedral networks, molecular complexity, polytopes, information content, Shannon entropy, symmetry breaking, recursive transformation

وصف الملف: application/pdf

Relation: https://dx.doi.org/10.3390/e20070534

الاتاحة: https://doi.org/10.3390/e20070534

المؤلفون: Zenil, Hector, Kiani, Narsis A., Shang, Ming-mei, Tegner, Jesper

المساهمون: Biological and Environmental Sciences and Engineering (BESE) Division, Bioscience Program, Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division, Algorithmic Nature Group, LABORES for the Natural and Digital Sciences, Paris, , France, Science for Life Laboratory, SciLifeLab, Stockholm, , Sweden, Unit of Computational Medicine, Department of Medicine, Karolinska Institute, Stockholm, , Sweden, Algorithmic Dynamics Lab, Centre for Molecular Medicine, Karolinska Institute, Stockholm, , Sweden

مصطلحات موضوعية: algorithmic information theory, algorithmic probability, causal path, causality, chemical compound complexity, information signature, Kolmogorov-Chaitin complexity, Molecular complexity, Shannon entropy

وصف الملف: application/pdf

Relation: http://arxiv.org/abs/1802.05856v1; http://arxiv.org/pdf/1802.05856v1; 1802.05856; Zenil H, Kiani NA, Shang M, Tegnér J (2018) Algorithmic Complexity and Reprogrammability of Chemical Structure Networks. Parallel Processing Letters 28: 1850005. Available: http://dx.doi.org/10.1142/S0129626418500056.; Parallel Processing Letters; http://hdl.handle.net/10754/627192

الاتاحة: http://hdl.handle.net/10754/627192
https://doi.org/10.1142/S0129626418500056

المؤلفون: Soler Toscano, Fernando, Zenil, Hector, Delahaye, Jean-Paul, Gauvrit, Nicolas

المساهمون: Universidad de Sevilla. Departamento de Filosofía y Lógica y Filosofía de la Ciencia, Universidad de Sevilla. HUM609: Grupo de Lógica, Lenguaje e Información

مصطلحات موضوعية: Kolmogorov-Chaitin complexity, Solomonoff-Levin algorithmic probability, Program-size complexity, Bennett's logical depth, Small Turing machines

Relation: Computability, 2 (2), 125-140.; https://doi.org/10.3233/COM-13019; https://idus.us.es/handle/11441/64143

الاتاحة: https://idus.us.es/handle/11441/64143

المؤلفون: Zenil, Hector, Soler Toscano, Fernando, Delahaye, Jean-Paul, Gauvrit, Nicolas

المساهمون: Universidad de Sevilla. Departamento de Filosofía y Lógica y Filosofía de la Ciencia

مصطلحات موضوعية: Algorithmic complexity, Algorithmic probability, Kolmogorov–Chaitin complexity, Algorithmic information theory, Cellular automata, Solomonoff–Levin universal distribution, Information theory, Dimensional complexity, Image complexity, Small Turing machines

Relation: PeerJ Computer Sciense, 1:e23, 1-31.; http://dx.doi.org/10.7717/peerj-cs.23; https://idus.us.es/handle/11441/64223

الاتاحة: https://idus.us.es/handle/11441/64223

المؤلفون: David A. Rosenblueth, James A. R. Marshall, Carlos Gershenson, Hector Zenil

المصدر: Entropy, Vol 14, Iss 11, Pp 2173-2191 (2012)

مصطلحات موضوعية: behavioral ecology, algorithmic randomness, computational thermodynamics, Kolmogorov–Chaitin complexity, information theory, Science, Astrophysics, QB460-466, Physics, QC1-999

وصف الملف: electronic resource

Relation: http://www.mdpi.com/1099-4300/14/11/2173; https://doaj.org/toc/1099-4300

URL الوصول: https://doaj.org/article/b703d0bfb32b41f88810dc99dfd521cb

المؤلفون: Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit

المصدر: PeerJ Computer Science, Vol 1, p e23 (2015)

مصطلحات موضوعية: Algorithmic complexity, Algorithmic probability, Kolmogorov–Chaitin complexity, Algorithmic information theory, Cellular automata, Solomonoff–Levin universal distribution, Electronic computers. Computer science, QA75.5-76.95

وصف الملف: electronic resource

Relation: https://peerj.com/articles/cs-23.pdf; https://peerj.com/articles/cs-23/; https://doaj.org/toc/2376-5992

URL الوصول: https://doaj.org/article/9d1ad586ff294862af31a3a5b89de0a7

المؤلفون: Jean-paul Delahaye, Hector Zenil

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.cs.auckland.ac.nz/~cristian/Compsci750/reading_stuff/1101.pdf.

مصطلحات موضوعية: algorithmic probability, program-size complexity, Chaitin’s halting probability Omega, Levin’s Universal Distribution, coding theorem, Busy Beaver problem, Kolmogorov-Chaitin complexity

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.5865; http://www.cs.auckland.ac.nz/~cristian/Compsci750/reading_stuff/1101.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.5865
http://www.cs.auckland.ac.nz/~cristian/Compsci750/reading_stuff/1101.pdf

المؤلفون: Galatolo, Stefano, Hoyrup, Mathieu, Rojas, Cristobal

المساهمون: Dipartimento di Matematica Applicata Pisa (DMA), Theoretical adverse computations, and safety (CARTE), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Department of Mathematics University of Toronto, University of Toronto, 05 2452 260 ox

المصدر: ISSN: 0890-5401.

مصطلحات موضوعية: algorithmic randomness, Kolmogorov-Chaitin complexity, computable partition, effective symbolic dynamics, entropy, orbit complexity, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.2: Computability theory, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]

Relation: inria-00517382; https://inria.hal.science/inria-00517382; https://inria.hal.science/inria-00517382/document; https://inria.hal.science/inria-00517382/file/final.pdf

الاتاحة: https://inria.hal.science/inria-00517382
https://inria.hal.science/inria-00517382/document
https://inria.hal.science/inria-00517382/file/final.pdf
https://doi.org/10.1016/j.ic.2009.05.001

المؤلفون: Cristian Calude, Cezar Càmpeanu

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.cs.auckland.ac.nz/~cristian/binvsnonbin.ps.gz.

مصطلحات موضوعية: Instantaneous codes, Chaitin complexity, random strings, random sequences

وصف الملف: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.4182; http://www.cs.auckland.ac.nz/~cristian/binvsnonbin.ps.gz

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.4182
http://www.cs.auckland.ac.nz/~cristian/binvsnonbin.ps.gz

المؤلفون: Narsis A. Kiani, Jesper Tegnér, Hector Zenil

المصدر: Entropy, Vol 20, Iss 8, p 551 (2018)
Entropy

مصطلحات موضوعية: Network complexity, Theoretical computer science, Computer science, General Physics and Astronomy, lcsh:Astrophysics, Review, Kolmogorov-Chaitin complexity, 01 natural sciences, 010305 fluids & plasmas, algorithmic randomness, 0103 physical sciences, lcsh:QB460-466, Entropy (information theory), Invariant (mathematics), 010306 general physics, lcsh:Science, algorithmic information theory, Lossless compression, Algorithmic information theory, complex networks, Complex network, algorithmic probability, lcsh:QC1-999, biological networks, lcsh:Q, Algorithmic probability, Biological network, lcsh:Physics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b8a012146b3af77e61ce80cb91ee00b
http://www.mdpi.com/1099-4300/20/8/551

المؤلفون: Hector Zenil, Nicolas Gauvrit, Fernando Soler-Toscano, Jean-Paul Delahaye

المساهمون: Universidad de Sevilla. Departamento de Filosofía y Lógica y Filosofía de la Ciencia, Universidad de Sevilla. HUM609: Grupo de Lógica, Lenguaje e Información

المصدر: idUS. Depósito de Investigación de la Universidad de Sevilla
instname

مصطلحات موضوعية: FOS: Computer and information sciences, Solomonoff-Levin algorithmic probability, Formal Languages and Automata Theory (cs.FL), Computer Science - Information Theory, Computer Science - Formal Languages and Automata Theory, Computational Complexity (cs.CC), Kolmogorov-Chaitin complexity, Measure (mathematics), Program-size complexity, Theoretical Computer Science, law.invention, Turing machine, symbols.namesake, Small Turing machines, Artificial Intelligence, law, Compression (functional analysis), Bennett's logical depth, Independence (probability theory), Mathematics, Discrete mathematics, Lossless compression, Information Theory (cs.IT), Logical depth, Computer Science Applications, Computer Science - Computational Complexity, Computational Theory and Mathematics, Calculator, Large set (Ramsey theory), symbols

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18a51ba65c206bc97c48dff9af153e16
https://doi.org/10.3233/com-13019

المؤلفون: Mathieu Hoyrup, Cristobal Rojas, Stefano Galatolo

المساهمون: Dipartimento di Matematica Applicata [Pisa] (DMA), Theoretical adverse computations, and safety (CARTE), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Department of Mathematics [University of Toronto], University of Toronto, 05 2452 260 ox, Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)

المصدر: Information and Computation
Information and Computation, Elsevier, 2010, 208 (1), pp.23-41. ⟨10.1016/j.ic.2009.05.001⟩
Information and Computation, 2010, 208 (1), pp.23-41. ⟨10.1016/j.ic.2009.05.001⟩

مصطلحات موضوعية: FOS: Computer and information sciences, Dynamical systems theory, Computer Science - Information Theory, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], Symbolic dynamics, computable partition, 0102 computer and information sciences, Topological entropy, Dynamical Systems (math.DS), Kolmogorov-Chaitin complexity, 01 natural sciences, Theoretical Computer Science, algorithmic randomness, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, FOS: Mathematics, Entropy (information theory), Ergodic theory, orbit complexity, Kolmogorov–Chaitin complexity, 0101 mathematics, Mathematics - Dynamical Systems, effective symbolic dynamics, Mathematics, Discrete mathematics, 03D99, 37A05, 37A35, 60A99, Kolmogorov complexity, Information Theory (cs.IT), 010102 general mathematics, Probability (math.PR), Measure-preserving dynamical system, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.2: Computability theory, Computer Science Applications, Computational Theory and Mathematics, 010201 computation theory & mathematics, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], Invariant measure, entropy, Mathematics - Probability, Information Systems

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a309743469e7fbc6ff816b9823b94dcd
https://hal.inria.fr/inria-00517382

المؤلفون: Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit, Hector Zenil

المساهمون: Universidad de Sevilla. Departamento de Filosofía y Lógica y Filosofía de la Ciencia

المصدر: idUS. Depósito de Investigación de la Universidad de Sevilla
instname
PeerJ Computer Science, Vol 1, p e23 (2015)

مصطلحات موضوعية: Cellular automata, Algorithmic information theory, Theoretical computer science, Information theory, General Computer Science, DTIME, Kolmogorov complexity, Computational complexity theory, Computer science, 2-EXPTIME, Algorithmic learning theory, Image complexity, lcsh:QA75.5-76.95, Dimensional complexity, Algorithmic probability, Small Turing machines, Complexity class, lcsh:Electronic computers. Computer science, Kolmogorov–Chaitin complexity, Algorithmic complexity, Solomonoff–Levin universal distribution

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f7bd4de6a0423ba18852ae8c317c992
https://idus.us.es/handle/11441/64223

المؤلفون: Joosten, Joost, Soler-Toscano, Fernando, Zenil, Hector

المساهمون: Universitat de Barcelona (UB), Univ. Seville, Dept. Filosofia Log. & Filosofia, University of Sheffield Sheffield, Institut d'Histoire et de Philosophie des Sciences et des Techniques (IHPST), Université Paris 1 Panthéon-Sorbonne (UP1)-Département d'Etudes Cognitives - ENS-PSL (DEC), École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)

المصدر: ISSN: 1548-7199.

مصطلحات موضوعية: small Turing machines, Program-size complexity, Kolmogorov-Chaitin complexity, space/time complexity, computational complexity, algorithmic complexity, [SHS.HISPHILSO]Humanities and Social Sciences/History, Philosophy and Sociology of Sciences

الاتاحة: https://shs.hal.science/halshs-00792281

المؤلفون: Soler-Toscano, Fernando, Joosten, Joost, Zenil, Hector

المساهمون: Univ. Seville, Dept. Filosofia Log. & Filosofia, Universitat de Barcelona (UB), University of Sheffield Sheffield, Institut d'Histoire et de Philosophie des Sciences et des Techniques (IHPST), Université Paris 1 Panthéon-Sorbonne (UP1)-Département d'Etudes Cognitives - ENS-PSL (DEC), École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)

المصدر: Actas de las V Jornadas Ibéricas, Lógica Universal e Unidade da Ciência, CFCUL ; https://shs.hal.science/halshs-00792282 ; Actas de las V Jornadas Ibéricas, Lógica Universal e Unidade da Ciência, CFCUL, 2010, ⟨10.48550/arXiv.1010.1328⟩

مصطلحات موضوعية: small Turing machines, Program-size complexity, Kolmogorov-Chaitin complexity, space-time complexity, computational complexity, algorithmic complexity, geometric complexity, máquinas de Turing, [SHS.HISPHILSO]Humanities and Social Sciences/History, Philosophy and Sociology of Sciences

الاتاحة: https://shs.hal.science/halshs-00792282
https://doi.org/10.48550/arXiv.1010.1328

المؤلفون: Whidborne, James F., McKernan, John, Gu, Da-Wei

مصطلحات موضوعية: Controller complexity, finite-precision arithmetic, finite word length, digital controller, Kolmogorov-Chaitin complexity

Relation: http://dx.doi.org/10.1007/s11633-006-0314-3; http://dspace.lib.cranfield.ac.uk/handle/1826/1235

الاتاحة: https://doi.org/10.1007/s11633-006-0314-3
http://dspace.lib.cranfield.ac.uk/handle/1826/1235