论文标题
看,knave
Look, Knave
论文作者
论文摘要
我们研究了递归序列,其中$ s_n $是上一项$ s_ {n-1} $的二进制扩展的字面描述。通过调整Conway的技术,我们确定$ \ {s_n \} $的限制行为以及$ 2^{\ Mathbb {n}} $的相关自图的动态。我们的主要结果是一对二进制序列的存在和独特性,每个序列都是对方的称赞。我们还借此机会进行双关语。
We examine a recursive sequence in which $s_n$ is a literal description of what the binary expansion of the previous term $s_{n-1}$ is not. By adapting a technique of Conway, we determine limiting behaviour of $\{s_n\}$ and dynamics of a related self-map of $2^{\mathbb{N}}$. Our main result is the existence and uniqueness of a pair of binary sequences, each the compliment-description of the other. We also take every opportunity to make puns.