Presented on November 10, 2011 from 11:00 am to 12:00 pm in Skiles 006.Runtime: 56:36 minuteMan has grappled with the meaning and utility of randomness for centuries. Research in the Theory of Computation in the last thirty years has enriched this study considerably. I will describe two main aspects of this research on randomness, demonstrating respectively its power and weakness for making algorithms faster. I will address the role of randomness in other computational settings, such as space bounded computation and probabilistic and zero-knowledge proofs
This dissertation explores the multifaceted interplay between efficient computation and probability ...
Abstract. In algorithmic randomness, when one wants to define a ran-domness notion with respect to s...
Can we use some so-far-unused physical phenomena to compute something that usual computers cannot? R...
Random number generators are widely used in practical algorithms. Examples include simulation, numbe...
Random number generators are widely used in practical algorithms. Examples include simulation, numbe...
This review volume consists of an indispensable set of chapters written by leading scholars, scienti...
Exponentiation makes the difference between the bit size of this line and the num-ber (<̂C 2300) ...
In this paper, we investigate refined definitions of random sequences. Classical definitions have al...
Giuseppe Longo. Randomness and Determination, from Physics and Computing towards Biology. Invited L...
Space and time are the fundamental parameters of complexity theory. The thesis of this paper is that...
By flipping a coin repeatedly and recording the result, we can create a sequence that intuitively is...
We discuss our recent work on incorporating imprecision in the field of algorithmic randomness, base...
1. Why were you initially drawn to the study of computation and randomness? 2 1.1. Physical randomne...
Algorithmic randomness uses computability theory to define notions of randomness for infinite object...
This dissertation explores the multifaceted interplay between efficient computation and probability ...
Abstract. In algorithmic randomness, when one wants to define a ran-domness notion with respect to s...
Can we use some so-far-unused physical phenomena to compute something that usual computers cannot? R...
Random number generators are widely used in practical algorithms. Examples include simulation, numbe...
Random number generators are widely used in practical algorithms. Examples include simulation, numbe...
This review volume consists of an indispensable set of chapters written by leading scholars, scienti...
Exponentiation makes the difference between the bit size of this line and the num-ber (<̂C 2300) ...
In this paper, we investigate refined definitions of random sequences. Classical definitions have al...
Giuseppe Longo. Randomness and Determination, from Physics and Computing towards Biology. Invited L...
Space and time are the fundamental parameters of complexity theory. The thesis of this paper is that...
By flipping a coin repeatedly and recording the result, we can create a sequence that intuitively is...
We discuss our recent work on incorporating imprecision in the field of algorithmic randomness, base...
1. Why were you initially drawn to the study of computation and randomness? 2 1.1. Physical randomne...
Algorithmic randomness uses computability theory to define notions of randomness for infinite object...
This dissertation explores the multifaceted interplay between efficient computation and probability ...
Abstract. In algorithmic randomness, when one wants to define a ran-domness notion with respect to s...
Can we use some so-far-unused physical phenomena to compute something that usual computers cannot? R...