Computer Science – Computational Complexity
Scientific paper
1999-09-21
Computer Science
Computational Complexity
revised version
Scientific paper
Martin-Lof's definition of random sequences of cbits as those not belonging to any set of constructive zero Lebesgue measure is reformulated in the language of Algebraic Probability Theory. The adoption of the Pour-El Richards theory of computability structures on Banach spaces allows us to give a natural noncommutative extension of Martin-Lof's definition, characterizing the random elements of a chain Von Neumann algebra. In the particular case of the minimally informative noncommutative alphabet our definition reduces to the definition of a random sequence of qubits.
No associations
LandOfFree
Noncommutative Martin-Lof randomness : on the concept of a random sequence of qubits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Noncommutative Martin-Lof randomness : on the concept of a random sequence of qubits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Noncommutative Martin-Lof randomness : on the concept of a random sequence of qubits will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-14836