从旧硬币中提取新硬币:带有未知偏差的计算
New coins from old: computing with unknown bias
摘要:
假设我们给定一个函数f:(0,1)->(0,1),并且对于(0,1)中的某个未知p,给出一个p硬币的独立投掷序列(即,概率p为“正面”的硬币)。对于哪些函数f可以模拟f(p)-硬币?这个问题是由S提出的。Asmussen和J. Propp.冯·诺依曼(von Neumann,1951)描述了一个简单的模拟常数函数1/2的方案;这个方案可以很容易地使用有限自动机实现。我们证明了在一般情况下,一个f(p)-硬币可以被一个有限自动机模拟,当且仅当f是Q上的一个有理函数。我们还证明了,如果一个f(p)-硬币可以用下推自动机模拟,那么f是Q上的代数函数;然而,下推自动机可以模拟某些非有理函数的f(p)-硬币,例如p的平方根。这些结果补充了Keane和O 'Brien(1994)的工作,他确定了函数$f$,当对模拟方案没有计算限制时,f(p)硬币可以针对该函数进行模拟。
英文摘要:
Suppose that we are given a function f : (0,1) -> (0,1) and, for some unknown p in (0,1), a sequence of independent tosses of a p-coin (i.e., a coin with probability p of ``heads''). For which functions f is it possible to simulate an f(p)-coin?; This question was raised by S. Asmussen and J. Propp. A simple simulation scheme for the constant function 1/2 was described by von Neumann (1951); this scheme can be easily implemented using a finite automaton. We prove that in general, an f(p)-coin can be simulated by a finite automaton for all p in (0,1), if and only if f is a rational function over Q. We also show that if an f(p)-coin can be simulated by a pushdown automaton, then f is an algebraic function over Q; however, pushdown automata can simulate f(p)-coins for certain non-rational functions such as the square root of p. These results complement the work of Keane and O'Brien (1994), who determined the functions $f$ for which an f(p)-coin can be simulated when there are no computational restrictions on the simulation scheme.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。