Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Randomness

Known as: Random, Non-random, Random data 
Randomness is the lack of pattern or predictability in events. A random sequence of events, symbols or steps has no order and does not follow an… Expand
Wikipedia

Related topics

Related topics

49 relations
A New Kind of ScienceAccident (philosophy)Adaptive sortArnold's cat map
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Wireless Communications Through Reconfigurable Intelligent Surfaces
The future of mobile communications looks exciting with the potential new use cases and challenging requirements of future 6th… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Review
2019
Review
2019
Hyperparameters and tuning strategies for random forest
The random forest (RF) algorithm has several hyperparameters that have to be set by the user, for example, the number of… Expand
Is this relevant?
Review
2017
Review
2017
Age of Information: A New Concept, Metric, and Tool
In an increasingly networked world in which information is becoming increasingly actual, how can a system know with certainty… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
  • figure 3.2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Algorithmic Randomness and Complexity
Preface.- Acknowledgments.- Introduction.- I. Background.- Preliminaries.- Computability Theory.- Kolmogorov Complexity of Finite… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Computability and randomness
The interplay between computability and randomness has been an active area of research in recent years, reflected by ample… Expand
  • figure 1.1
  • table 3.1
  • figure 4.1
  • table 5.1
  • figure 5.1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A rational route to randomness
Complex dynamics in economics arise from nonlinear systems that do not converge to a fixed point, a limit cycle, or explode or… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Randomness is Linear in Space
We show that any randomized algorithm that runs in spaceSand timeTand uses poly(S) random bits can be simulated using onlyO(S… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Hardness vs Randomness
We present a simple new construction of a pseudorandom bit generator. It stretches a short string of truly random bits into a… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations
The fundamental principles, basic mechanisms, and formal analyses involved in the development of parallel distributed processing… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Trading group theory for randomness
In a previous paper [BS] we proved, using the elements of the theory of <italic>nilpotent groups</italic>, that some of the… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE