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
2013
Review
2013
A Randomized Trial
Main Outcome Measures: We randomly assigned 4 medical house staff teams (43 interns) using a 3-month crossover design to a 2003… Expand
  • figure 1
  • figure 2
Highly Cited
2010
Highly Cited
2010
Algorithmic Randomness and Complexity
Preface.- Acknowledgments.- Introduction.- I. Background.- Preliminaries.- Computability Theory.- Kolmogorov Complexity of Finite… Expand
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
Highly Cited
2006
Highly Cited
2006
Randomized gossip algorithms
Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip… Expand
  • figure 1
  • figure 2
  • figure 3
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
Highly Cited
1997
Highly Cited
1997
Wrappers for Feature Subset Selection
Abstract In the feature subset selection problem, a learning algorithm is faced with the problem of selecting a relevant subset… Expand
  • figure I
  • table 1
  • figure 2
  • figure 3
  • figure 4
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
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
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
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
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