article

Mathematical metaphysics of randomness

Authors:

Andrei A. Muchnik,

Alexei L. Semenov,

Vladimir A. UspenskyAuthors Info & Claims

Theoretical Computer Science, Volume 207, Issue 2

Pages 263 - 317

https://doi.org/10.1016/S0304-3975(98)00069-3

Published: 06 November 1998 Publication History

Abstract

No abstract available.

Cited By

View all

Amirdjanov GGurevich IKostyuk FKulberg NRudchenko TSemenov ASotnikov ATrusova YUvarov AVardanyan VYakovleva TYashina VZakharova A(2023)The Role of the Scientific Council “Cybernetics” of the USSR Academy of Sciences/the Russian Academy of Sciences in the Development of National Cybernetics and Computer TechnologyPattern Recognition and Image Analysis10.1134/S105466182304005333:4(988-1049)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1134/S1054661823040053
Hitchcock JSekoni AShafei H(2021)Polynomial-Time Random Oracles and Separating Complexity ClassesACM Transactions on Computation Theory10.1145/343438913:1(11-16)Online publication date: 21-Jan-2021
https://dl.acm.org/doi/10.1145/3434389
Rute J(2016)When does randomness come from randomness?Theoretical Computer Science10.1016/j.tcs.2016.05.001635:C(35-50)Online publication date: 4-Jul-2016
https://dl.acm.org/doi/10.1016/j.tcs.2016.05.001
Show More Cited By

Index Terms

Mathematical metaphysics of randomness
1. Mathematics of computing
2. Theory of computation
  1. Models of computation
    1. Probabilistic computation

Recommendations

Hyperchaotic system‐based pseudorandom number generator

Pseudorandom sequences are very important in the field of cryptography. The characteristics such as non‐linearity and random‐like behaviours make chaotic systems suited to generate pseudorandom sequences. However, most of chaos‐based pseudorandom number ...
The complexity of stochastic sequences

We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random sequences such that for any computable, non-decreasing and unbounded function f and for almost ...
On the Encryption of Image Decompression with User's Identity
SNPD '07: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03

The internet has been a main method of image's transmission and storage. A significative problem is how to prevent illegal diffusion for some images. In this paper, we prefer an effective method of registering the decode program with the user's identity ...

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 207, Issue 2

Special issue Kolmogorov complexity

Nov. 1998

131 pages

ISSN:0304-3975

Editors:
M. Nivat
Univ. de Paris, Moiselles, France
,
A. Semenov
Institute of New Technologies, Moscow, Russia

Issue’s Table of Contents

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 06 November 1998

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Amirdjanov GGurevich IKostyuk FKulberg NRudchenko TSemenov ASotnikov ATrusova YUvarov AVardanyan VYakovleva TYashina VZakharova A(2023)The Role of the Scientific Council “Cybernetics” of the USSR Academy of Sciences/the Russian Academy of Sciences in the Development of National Cybernetics and Computer TechnologyPattern Recognition and Image Analysis10.1134/S105466182304005333:4(988-1049)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1134/S1054661823040053
Hitchcock JSekoni AShafei H(2021)Polynomial-Time Random Oracles and Separating Complexity ClassesACM Transactions on Computation Theory10.1145/343438913:1(11-16)Online publication date: 21-Jan-2021
https://dl.acm.org/doi/10.1145/3434389
Rute J(2016)When does randomness come from randomness?Theoretical Computer Science10.1016/j.tcs.2016.05.001635:C(35-50)Online publication date: 4-Jul-2016
https://dl.acm.org/doi/10.1016/j.tcs.2016.05.001
Rute J(2016)Computable randomness and betting for computable probability spacesMathematical Logic Quarterly10.1002/malq.20120008962:4-5(335-366)Online publication date: 12-Sep-2016
Carayol AHaddad ASerre O(2014)Randomization in Automata on Infinite TreesACM Transactions on Computational Logic10.1145/262933615:3(1-33)Online publication date: 17-Jul-2014
https://dl.acm.org/doi/10.1145/2629336
Harkins RHitchcock J(2013)Exact Learning Algorithms, Betting Games, and Circuit Lower BoundsACM Transactions on Computation Theory10.1145/2539126.25391305:4(1-11)Online publication date: 1-Nov-2013
https://dl.acm.org/doi/10.1145/2539126.2539130
Kjos-Hanssen BTaveneaux AThapen N(2012)How much randomness is needed for statistics?Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes10.1007/978-3-642-30870-3_40(395-404)Online publication date: 18-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-30870-3_40
Downey R(2012)Randomness, computation and mathematicsProceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes10.1007/978-3-642-30870-3_17(162-181)Online publication date: 18-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-30870-3_17
Harkins RHitchcock J(2011)Exact learning algorithms, betting games, and circuit lower boundsProceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I10.5555/2027127.2027171(416-423)Online publication date: 4-Jul-2011
https://dl.acm.org/doi/10.5555/2027127.2027171
Takahashi H(2011)Algorithmic randomness and monotone complexity on product spaceInformation and Computation10.1016/j.ic.2010.10.003209:2(183-197)Online publication date: 1-Feb-2011
https://dl.acm.org/doi/10.1016/j.ic.2010.10.003
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Hyperchaotic system‐based pseudorandom number generator

The complexity of stochastic sequences

On the Encryption of Image Decompression with User's Identity

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations