Výsledky vyhľadávania - "algorithmic complexity theory"

Complexity and Entropy in Legal Language

Autori: Friedrich, Roland

Zdroj: Frontiers in Physics, Vol 9 (2021)
Frontiers in Physics, 9

Predmety: Complex systems, Information theory, Physics, QC1-999, linguistics, Shannon entropy, algorithmic complexity theory, Linguistics, 16. Peace & justice, 01 natural sciences, legal theory, Legal theory, Algorithmic complexity theory, Lossless compression algorithms, 0103 physical sciences, FOS: Languages and literature, lossless compression algorithms, complex systems, information theory

Popis súboru: application/application/pdf

Prístupová URL adresa: https://www.frontiersin.org/articles/10.3389/fphy.2021.671882/pdf
https://doaj.org/article/a17b4004407f4c1f923b086e48e02eda
https://www.frontiersin.org/articles/10.3389/fphy.2021.671882/full
https://ui.adsabs.harvard.edu/abs/2021FrP.....9..279F/abstract
http://hdl.handle.net/20.500.11850/491068

An algorithmic view of pseudochaos

Autori: B. V. Chirikov Franco Vivaldi

Zdroj: Physica D: Nonlinear Phenomena. 129:223-235

Predmety: pseudochaos, Dynamical systems in other branches of physics (quantum mechanics, general relativity, laser physics), bounded mesoscopic quantum systems, ergodic theory, 0103 physical sciences, algorithmic complexity theory, 01 natural sciences, Quantum chaos, quantum chaos

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1374340
https://doi.org/10.1016/s0167-2789(98)00319-4
http://www.quantware.ups-tlse.fr/chirikov/refs/chi1999b.pdf
http://ui.adsabs.harvard.edu/abs/1999PhyD..129..223C/abstract
http://www.sciencedirect.com/science/article/pii/S0167278998003194
https://www.quantware.ups-tlse.fr/chirikov/refs/chi1999b.pdf
https://www.sciencedirect.com/science/article/abs/pii/S0167278998003194

Optimal representation in average using Kolmogorov complexity

Autori: Eric Rivals Jean-Paul Delahaye

Zdroj: Theoretical Computer Science. 200:261-287

Predmety: 0301 basic medicine, 0303 health sciences, 03 medical and health sciences, Information theory, Optimal coding, Compression, Kolmogorov complexity, algorithmic complexity theory, \(K\)-optimality on average, Algorithmic information theory (Kolmogorov complexity, etc.), Theoretical Computer Science, Computer Science(all)

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1243219
https://doi.org/10.1016/s0304-3975(97)00275-2

On relative randomness

Autori: Antonín Kučera

Zdroj: Annals of Pure and Applied Logic. 63:61-67

Predmety: constructive measure 0, Logic, random set, relative randomness, algorithmic complexity theory, 0101 mathematics, Automata and formal grammars in connection with logical questions, Other constructive mathematics, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.), Constructive and recursive analysis

Popis súboru: application/xml

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/apal/apal63.html#Kucera93
https://www.sciencedirect.com/science/article/abs/pii/016800729390209V
https://www.sciencedirect.com/science/article/pii/016800729390209V

The representation and manipulation of the algorithmic probability measure for problem solving: The representation and manipulation of the algorithmic probability measure for problem solving.

Autori: Alexander Gammerman

Zdroj: Annals of Mathematics and Artificial Intelligence. 4:281-300

Predmety: algorithmic complexity theory, algorithmic probability measure, Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1005863
https://doi.org/10.1007/bf01531061
https://link.springer.com/article/10.1007/BF01531061
https://dblp.uni-trier.de/db/journals/amai/amai4.html#Gammerman91
https://researchportal.hw.ac.uk/en/publications/the-representation-and-manipulation-of-the-algorithmic-probabilit

On elementary computability-theoretic properties of algorithmic randomness

Autori: A Arslanov

Predmety: Other information and computing sciences not elsewhere classified, Blankendmarker, elementary computability, algorithmic complexity theory, hyperimmune sets

Dostupnosť: https://doi.org/10.26180/20707921.v1
https://figshare.com/articles/report/On_elementary_computability-theoretic_properties_of_algorithmic_randomness/20707921

Financial Market Efficiency Should be Gauged in Relative Rather than Absolute Terms

Autori: Da Silva, Sergio

Zdroj: Journal of Stock & Forex Trading.

Predmety: 2. Zero hunger, 0301 basic medicine, 03 medical and health sciences, jel:G14, 0502 economics and business, 05 social sciences, Algorithmic complexity theory, Efficient market hypothesis, Financial market efficiency, Relative market efficiency, Mild type I randomness, Wild type II randomness, 16. Peace & justice, jel:G00

Prístupová URL adresa: https://mpra.ub.uni-muenchen.de/64497/1/MPRA_paper_64497.pdf
https://www.longdom.org/abstract/financial-market-efficiency-should-be-gauged-in-relative-rather-than-absolute-terms-10897.html
https://www.omicsonline.org/open-access/financial-market-efficiency-should-be-gauged-in-relative-rather-than-absolute-terms-2168-9458-4-140.php?aid=40404
https://ideas.repec.org/p/pra/mprapa/64497.html
https://www.omicsgroup.org/journals/financial-market-efficiency-should-be-gauged-in-relative-rather-than-absolute-terms-2168-9458-4-140.pdf
https://works.bepress.com/sergiodasilva/158/
https://works.bepress.com/sergiodasilva/158/download/

Physica D 129 (1999) 223–235 An algorithmic view of pseudochaos

Autori: B. V. Chirikov A F. Vivaldi B The Pennsylvania State University CiteSeerX Archives

Prispievatelia: B. V. Chirikov A F. Vivaldi B The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.quantware.ups-tlse.fr/chirikov/refs/chi1999b.pdf.

Predmety: Quantum chaos, Pseudochaos, Algorithmic complexity theory, Ergodic theory

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.3414

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.3414
http://www.quantware.ups-tlse.fr/chirikov/refs/chi1999b.pdf

Randomness conservation inequalities; information and independence in mathematical theories

Autori: Leonid A. Levin

Zdroj: Information and Control. 61:15-37

Predmety: algorithmic information, Applications of computability and recursion theory, probability theory, Kolmogorov's algorithmic complexity theory, 0102 computer and information sciences, intuitionistic logic, 0101 mathematics, Algorithms in computer science, Information theory (general), 01 natural sciences, mutual information in individual infinite sequences, theory of algorithms, Engineering(all)

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/3950512
https://doi.org/10.1016/s0019-9958(84)80060-1

Ranking the stocks listed on Bovespa according to their relative efficiency

Autori: Giglio, Ricardo Da Silva, Sergio

Predmety: jel:G14, jel:C0, Algorithmic complexity theory, Econophysics, Financial efficiency

Prístupová URL adresa: https://mpra.ub.uni-muenchen.de/22720/1/MPRA_paper_22720.pdf

Algorithmic complexity theory and the relative efficiency of financial markets - Updated

Autori: Giglio, Ricardo Matsushita, Raul Figueiredo, Annibal a ďalší

Predmety: jel:G14, jel:C63, financial market efficiency, algorithmic complexity theory

Prístupová URL adresa: https://mpra.ub.uni-muenchen.de/11150/1/MPRA_paper_11150.pdf