Filters








1,004,081 Hits in 3.8 sec

A complexity theoretic approach to randomness

Michael Sipser
1983 Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83  
We study a time bounded variant of Kolmogorov complexity.  ...  To copy otherwise, or to republish, requires a fee and/or specific permission. © 1983 ACM 0-89791-099-0/83/004/0330 $00.75 Yao [Y] give definitions of the notion of a random set of strings based upon polynomial  ...  In this paper we present a complexity theoretic definition of randomness derived from Kolmogorov complexity.  ... 
doi:10.1145/800061.808762 dblp:conf/stoc/Sipser83a fatcat:vrxhqh3lnnbzjcunoameukvxly

Sampling for qualitative research

Martin N Marshall
1996 Family Practice  
This article considers and explains the differences between the two approaches and describes three broad categories of naturalistic sampling: convenience, judgement and theoretical models.  ...  Acknowledgements I would like to thank Ms Nicky Britten for her comments on this paper.  ...  The study of the professional relationship between specialists and GPs is funded by a Research and Training Fellowship from the Research and Development Directorate of the South and West Regional Health  ... 
doi:10.1093/fampra/13.6.522 pmid:9023528 fatcat:3bkaot5gkzcy3jhzb5bhxofxbu

Thermodynamic Consistency of the Cushman Method of Computing the Configurational Entropy of a Landscape Lattice

Samuel A. Cushman
2021 Entropy  
Third, at full mixing, the entropy will fluctuate randomly around the maximum theoretical value, associated with a perfectly random arrangement of the lattice.  ...  There has been a recent surge of interest in theory and methods for calculating the entropy of landscape patterns, but relatively little is known about the thermodynamic consistency of these approaches  ...  All of these approaches have theoretical strengths and differ in complexity and the measurements they produce.  ... 
doi:10.3390/e23111420 pmid:34828118 pmcid:PMC8617622 fatcat:vogzykmzgvgi7iuk6jo7xrt5xe

A Review of Graph and Network Complexity from an Algorithmic Information Perspective

Hector Zenil, Narsis Kiani, Jesper Tegnér
2018 Entropy  
Information-theoretic-based measures have been useful in quantifying network complexity.  ...  We review the fragility of computable measures on the one hand and the invariant properties of algorithmic measures on the other demonstrating how current approaches to algorithmic complexity are misguided  ...  This is what we expect theoretically, since random graphs are the most algorithmically complex.  ... 
doi:10.3390/e20080551 pmid:33265640 fatcat:3gjsm5sbbrgk3fhj46sr6ilsui

A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions †

Hector Zenil
2020 Entropy  
It will be explained how different approaches to algorithmic complexity can explore the relaxation of different necessary and sufficient conditions in their pursuit of numerical applicability, with some  ...  We conclude with a discussion of possible directions that may or should be taken into consideration to advance the field and encourage methodological innovation, but more importantly, to contribute to  ...  For a review of the theoretical aspects of algorithmic randomness and progress made in the area, the reader would do well to consult this good, up-to-date survey [1] , while [2] provides an excellent  ... 
doi:10.3390/e22060612 pmid:33286384 pmcid:PMC7517143 fatcat:zvjn3miy6jeplkf44mzhjznmny

Lognormal Distribution Clutter Modeling Based on ZMNL Principle

2016 Revista Técnica de la Facultad de Ingeniería Universidad del Zulia  
The results show that in both clutter amplitude and clutter spectrum, the estimated value approaches the theoretical value. Finally, a summary of the full paper is presented.  ...  With electromagnetic working environment becoming more and more complex, how to model and analyze clutter exactly is very important in the radar research.  ...  With the increase of sampling frequency and length of the random sequence,estimated value in clutter amplitude and clutter spectrum approaches the theoretical value.  ... 
doi:10.21311/001.39.8.50 fatcat:c3ybxl3o55bvxlutdfx2zmfxdi

A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions [article]

Hector Zenil
2020 arXiv   pre-print
It will be explained how different approaches to algorithmic complexity can explore the relaxation of different necessary and sufficient conditions in their pursuit of numerical applicability, with some  ...  We conclude with a discussion of possible directions that may or should be taken into consideration to advance the field and encourage methodological innovation, but more importantly, to contribute to  ...  For a review of the theoretical aspects of algorithmic randomness and progress made in the area the reader would do well to consult this good, up-to-date survey [1] , while this [2] provides an excellent  ... 
arXiv:2003.11044v6 fatcat:b3knbpsfgjaqtptgczfxye2cx4

Antigenesis: A cascade-theoretical analysis of the size distributions of antigen—antibody complexes

Robert Gross, Martin L. Yarmush, John W. Kennedy, Louis V. Quintas
1988 Discrete Applied Mathematics  
These approaches, however, overlook the fact that a systematic approach to such problems is available within the scope of the class of random graph processes known as branching or cascade processes.  ...  In this paper, we introduce, with sufficient detail for the reader to follow, the details of a cascade theoretical model for antigen-antibody systems and show how the molecular weight distribution for  ...  MLY is a Lucille P. Markey Scholar in Biomedical Science.  ... 
doi:10.1016/0166-218x(88)90013-3 fatcat:uo5um4brqrcy3o5fh2wsace4xq

Entropy and software systems

Linmin Yang, Zhe Dang, Thomas R. Fischer, Min Sik Kim, Li Tan
2010 Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER '10  
Our information-theoretic approach is syntax-independent, which is a desired property in software testing.  ...  Moreover, we introduce behaviorial complexity as a novel complexity metric for labeled graphs (which can be interpreted as control flow graphs, design specifications, etc.), which is also based on information  ...  What merits can this information-theoretic approach bring to software testing?  ... 
doi:10.1145/1882362.1882449 dblp:conf/sigsoft/YangDFKT10 fatcat:zzlsvyvnhfd3vku4qtlxy46zrm

Randomness Increases Order in Biological Evolution [chapter]

Giuseppe Longo, Maël Montévil
2012 Lecture Notes in Computer Science  
Lastly, we analyze the situation in terms of theoretical symmetries, in order to further specify the biological meaning of anti-entropy as well as its strong link with randomness.  ...  This approach, in particular, focuses on the role of global entropy production and provides a tool for a mathematical understanding of some fundamental observations by Gould on the increasing phenotypic  ...  Thus there is no need for a global design or aim: the random paths that compose any diffusion, also in this case help to understand a random growth of complexity, on average.  ... 
doi:10.1007/978-3-642-27654-5_22 fatcat:kgdn73tqkfff5a7wd2pfgzppo4

Page 2411 of Mathematical Reviews Vol. , Issue 96d [page]

1996 Mathematical Reviews  
Chaitin’s approach is chosen as basic: a string x is said to be m-random if H(x) > max{H(y): |y| =|x|}— m. It is compared with the approach based on Kolmogorov com- plexity.  ...  A sequence is called random if it passes every Martin-Lof sequential test. Measure-theoretical and complexity characteriza- tions of random sequences are presented which show that the  ... 

General practice needs further development of theoretical knowledge

Geir Sverre Braut, Svein R. Kjosavik
2019 Scandinavian Journal of Primary Health Care  
The underlying presumption is that it is possible to study a sequence of random trials that approaches infinity [7] .  ...  When approaching diseases that can be described and understood according to a principle of one agent, one disease, this seems to be a sound theoretical platform.  ... 
doi:10.1080/02813432.2019.1641900 pmid:31309859 pmcid:PMC6713175 fatcat:cdc24suujfhnhfk7xsunu4yeva

An Information Theoretic Analysis of Random Number Generator based on Cellular Automaton

Amirahmad Nayyeri, Gholamhossein Dastghaibyfard
2018 International Journal of Advanced Computer Science and Applications  
Then a complex-system-based Random Number Generator would be introduced.  ...  Realization of Randomness had always been a controversial concept with great importance both from theoretical and practical Perspectives.  ...  The unpredictability as an intuitive notion of randomness plays a great role in other approaches for defining randomness. Ville [8] tried to define randomness by gambling approach.  ... 
doi:10.14569/ijacsa.2018.090144 fatcat:f5racgi5urfola7ctdm5j4wvse

Editorial

Elvira Mayordomo, Wolfgang Merkle
2015 Theory of Computing Systems  
Finally, Vinod Vinodchandran and Marius Zimand obtain a dichotomy on compressibility by deriving, under a certain complexity-theoretical assumption, a positive result On optimal language compression for  ...  Andrei Romashchenko and Alexander Shen propose an interesting fresh approach that uses Topological arguments for Kolmogorov complexity in order to construct strings with prescribed Kolmogorov complexity  ... 
doi:10.1007/s00224-015-9620-x fatcat:67fgsiiodvf7hpnsmzuczzdu3e

Preface of the Special Issue Probing the Limits of Quantum Mechanics: Theory and Experiment, Volume 1

Andrei Khrennikov, Hans de Raedt, Arkady Plotnitsky, Sergey Polyakov
2015 Foundations of physics  
In general the field of quantum information is a great playground for testing various interpretations of quantum mechanics-especially of the information nature, such as operational approaches to quantum  ...  While complemented by the more traditional philosophical analysis, foundational studies are now based much more firmly on complex theoretical models, advanced mathematics and numerical simulations, very  ...  Contextuality A new approach to contextuality proposed by Dzhafarov, Kujala, and Larsson is based on the idea that contextuality is measured by the highest correlation one can achieve between random variables  ... 
doi:10.1007/s10701-015-9911-8 fatcat:lspi6yi7brajbmhgvhlc2hyx6y
« Previous Showing results 1 — 15 out of 1,004,081 results