↧
Answer by Thomas Lumley for Probability algorithm on strings
Ok, so you have strings $Z_n$ that are exactly half 0s and half 1s and you have $X_n$ that have exactly one more 1.One way to generate these sorts of strings is to generate a $Z_n$ uniformly at random...
View ArticleProbability algorithm on strings
Let $x$ be any binary string $\in (0,1)^*.$The majority language is given by:$$\text{MAJ}:=\{x\in (0,1)^*:\sum_{i=1}^ {|x|}x_i>\frac{|x|}{2}\},\text{where $x_i$ is the $i$-th position value(either...
View Article