Parinya: /* Intro */

2007-04-10T05:46:43Z

Intro

Parinya เมื่อ 05:44, 10 เมษายน 2550

2007-04-10T05:44:16Z

หน้าใหม่

== Intro ==
Several works have shown that, if we have many independent sources, each having enough 'randomness', then we can extract pure randomness from them. Anup Rao recently showed that another assumption also suffices for randomness extraction, i.e. the source is generated by small space Turing machine.

An interesting special case is one that we are given two independent sources

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 05:46, 10 เมษายน 2550
แถว 2:		แถว 2:
	Several works have shown that, if we have many independent sources, each having enough 'randomness', then we can extract pure randomness from them. Anup Rao recently showed that another assumption also suffices for randomness extraction, i.e. the source is generated by small space Turing machine.		Several works have shown that, if we have many independent sources, each having enough 'randomness', then we can extract pure randomness from them. Anup Rao recently showed that another assumption also suffices for randomness extraction, i.e. the source is generated by small space Turing machine.

−	An interesting special case is one that we are given two independent sources	+	One is tempted to ask the question whether another weaker assumption implies the possibility of randomness extraction, so basically we are looking at this problem where the assumption of interest is the notion of 'almost' independent sources.
		+
		+	An interesting special case to study is one that we are given two independent sources. In this case, the best known extractor was given by Bourgain.

Mutual Information and Randomness Extraction - ประวัติรุ่นแก้ไข

Parinya: /* Intro */

Parinya เมื่อ 05:44, 10 เมษายน 2550