Suchergebnisse - "algorithmic complexity theory"

  1. 1

    Complexity and Entropy in Legal Language von Friedrich, Roland

    ISSN: 2296-424X, 2296-424X
    Veröffentlicht: Frontiers Media S.A 04.06.2021
    Veröffentlicht in Frontiers in physics (04.06.2021)
    “… We study the language of legal codes from different countries and legal traditions, using concepts from physics, algorithmic complexity theory and information theory …”
    Volltext
    Journal Article
  2. 2

    Algorithmic Complexity Theory von Yatsko, Andrzej, Suslow, Walery

    ISBN: 3110469871, 9783110469875
    Veröffentlicht: Germany Walter de Gruyter GmbH 2016
    Volltext
    Buchkapitel
  3. 3

    Sample size lower bounds in PAC learning by algorithmic complexity theory von Apolloni, B., Gentile, C.

    ISSN: 0304-3975, 1879-2294
    Veröffentlicht: Amsterdam Elsevier B.V 06.12.1998
    Veröffentlicht in Theoretical computer science (06.12.1998)
    “… This paper focuses on a general setup for obtaining sample size lower bounds for learning concept classes under fixed distribution laws in an extended PAC …”
    Volltext
    Journal Article
  4. 4

    An algorithmic view of pseudochaos von Chirikov, B.V., Vivaldi, F.

    ISSN: 0167-2789, 1872-8022
    Veröffentlicht: Elsevier B.V 15.05.1999
    Veröffentlicht in Physica. D (15.05.1999)
    “… The controversial concept of quantum chaos – the dynamical chaos in bounded mesoscopic quantum systems – is presented as the most important and universal …”
    Volltext
    Journal Article
  5. 5

    Algorithmic complexity theory and the relative efficiency of financial markets von Giglio, Ricardo, Matsushita, Raul, Figueiredo, Annibal, Gleria, Iram, Da Silva, Sergio

    Veröffentlicht: St. Louis Federal Reserve Bank of St. Louis 01.01.2008
    Veröffentlicht in IDEAS Working Paper Series from RePEc (01.01.2008)
    “… One way of dealing with the relative efficiency of markets is to resort to the efficiency interpretation provided by algorithmic complexity theory …”
    Volltext
    Paper
  6. 6

    Algorithmic complexity theory and the relative efficiency of financial markets - Updated von Giglio, Ricardo, Matsushita, Raul, Figueiredo, Annibal, Gleria, Iram, Da Silva, Sergio

    Veröffentlicht: St. Louis Federal Reserve Bank of St. Louis 01.01.2008
    Veröffentlicht in IDEAS Working Paper Series from RePEc (01.01.2008)
    “… One way of dealing with the relative efficiency of markets is to resort to the efficiency interpretation provided by algorithmic complexity theory …”
    Volltext
    Paper
  7. 7

    Introduction von Zambelli, Stefano

    ISBN: 1444350315, 9781444350319
    Veröffentlicht: Chichester, UK John Wiley & Sons, Ltd 06.01.2012
    “… This chapter contains sections titled: Background, Motivation and Initiatives Summary and Outline of the Contributions Concluding Notes and Lessons for the …”
    Volltext
    Buchkapitel
  8. 8

    Chaos: from simple models to complex systems von Cencini, Massimo, Cecconi, Fabio, Vulpiani, Angelo

    ISBN: 9789814277655, 9814277657, 9789814277662, 9814277665, 9813203587, 9789813203587
    Veröffentlicht: New Jersey World Scientific Publishing Co. Pte. Ltd 2010
    “… Chaos: from simple models to complex systems aims to guide science and engineering students through chaos and nonlinear dynamics from classical examples to the …”
    Volltext
    E-Book Buch
  9. 9

    Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence von Hernández-Orozco, Santiago, Hernández-Quiroz, Francisco, Zenil, Hector

    ISSN: 1064-5462
    Veröffentlicht: United States 2018
    Veröffentlicht in Artificial life (2018)
    “… Is undecidability a requirement for open-ended evolution (OEE)? Using methods derived from algorithmic complexity theory, we propose robust computational …”
    Weitere Angaben
    Journal Article
  10. 10

    Exploring a unified definition of ecological complexity towards restoration von Wu, Haoran, Soleiman, Jed, Bolam, Jamie, Boyle, Joseph Scott

    ISSN: 2950-3957, 2950-3957
    Veröffentlicht: Elsevier B.V 01.06.2025
    Veröffentlicht in Total Environment Advances (01.06.2025)
    “… •Contemporary conservation requires open-ended approaches that adopts complexity thinking.•We reviewed a plethora of thoughts on the concept of ‘complexity’, …”
    Volltext
    Journal Article
  11. 11

    Discovering Neural Nets with Low Kolmogorov Complexity and High Generalization Capability von Schmidhuber, Jürgen

    ISSN: 0893-6080, 1879-2782, 1879-2782
    Veröffentlicht: Oxford Elsevier Science 01.07.1997
    Veröffentlicht in Neural networks (01.07.1997)
    “… This paper addresses both issues. It first reviews some basic concepts of algorithmic complexity theory relevant to machine learing, and how the Solomonoff-Levin distribution (or universal prior …”
    Volltext
    Journal Article
  12. 12

    Quantum Dynamical Entropies and Gács Algorithmic Entropy von Benatti, Fabio

    ISSN: 1099-4300, 1099-4300
    Veröffentlicht: Basel MDPI AG 01.07.2012
    Veröffentlicht in Entropy (Basel, Switzerland) (01.07.2012)
    “… The same scenario appears in relation to the extension of algorithmic complexity theory to the quantum realm …”
    Volltext
    Journal Article
  13. 13

    Between Order and Chaos: The Quest for Meaningful Information von Adriaans, Pieter

    ISSN: 1432-4350, 1433-0490
    Veröffentlicht: New York Springer-Verlag 01.11.2009
    Veröffentlicht in Theory of computing systems (01.11.2009)
    “… In this context I introduce the notion of facticity of a data set. I discuss the relation between thermodynamics and algorithmic complexity theory in the context of this problem …”
    Volltext
    Journal Article
  14. 14

    Besicovitch Sets, Distance Sets, and Embeddings into Euclidean Spaces Without Shrinking von Altaf, Iqra

    ISBN: 9798286451555
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2025
    “… In this thesis, we study problems related to scaled oscillation, Besicovitch sets, Falconer distance problem and Sard’s theorem.In chapter 2 (joint work with …”
    Volltext
    Dissertation
  15. 15

    Emergence and Universal Computation von Lee, Cassey

    ISSN: 0026-1386, 1467-999X
    Veröffentlicht: Oxford, UK Blackwell Publishing Ltd 01.05.2004
    Veröffentlicht in Metroeconomica (01.05.2004)
    “… Attempts to formalize the notion of emergence via algorithmic complexity theory runs into the problem that the Kolmogorov complexity function is not computable …”
    Volltext
    Journal Article
  16. 16

    Efficiency of financial markets and algorithmic complexity von Giglio, R, Silva, S da, Gleria, Iram, Ranciaro, A, Matsushita, R, Figueiredo, A

    ISSN: 1742-6596, 1742-6588, 1742-6596
    Veröffentlicht: Bristol IOP Publishing 01.09.2010
    Veröffentlicht in Journal of physics. Conference series (01.09.2010)
    “… In this work we are interested in the concept of market efficiency and its relationship with the algorithmic complexity theory …”
    Volltext
    Journal Article
  17. 17

    Theoretical Analysis of an Adaptive Closeness Centrality-Based Algorithm for Dynamic Optimization of Transportation Networks von Mann, Michael

    ISSN: 3064-9382
    Veröffentlicht: IEEE 16.10.2024
    “… The analysis employs graph theory, algorithmic complexity theory, and competitive analysis techniques …”
    Volltext
    Tagungsbericht
  18. 18

    Distance sets bounds for polyhedral norms via effective dimension von Iqra Altaf, Ryan Bushling, Wilson, Bobby

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 01.11.2024
    Veröffentlicht in arXiv.org (01.11.2024)
    “… \). The techniques of algorithmic complexity theory underlie both the computations and the construction …”
    Volltext
    Paper
  19. 19

    A Secured MultiParty Computational Protocol to Protect Cyber Space von Mishra, Durgesh Kumar, Chandwani, Manohar

    ISSN: 1939-3555, 1939-3547
    Veröffentlicht: Taylor & Francis Group 11.08.2010
    Veröffentlicht in Information security journal. (11.08.2010)
    “… In this paper, we show how our secured multiparty computation (SMC) protocols protect the data of an organization during the war from the cyberspace war when a …”
    Volltext
    Journal Article
  20. 20

    Optimal representation in average using Kolmogorov complexity von Rivals, E., Delahaye, J.P.

    ISSN: 0304-3975, 1879-2294
    Veröffentlicht: Amsterdam Elsevier B.V 28.06.1998
    Veröffentlicht in Theoretical computer science (28.06.1998)
    “… One knows from the Algorithmic Complexity Theory 1 1 This theory is also called the Kolmogorov complexity or Algorithmic Information theory. [2–5, 8, 14 …”
    Volltext
    Journal Article