Infinite sets that admit fast exhaustive search

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) Pub Date : 2007-07-10 DOI:10.1109/LICS.2007.25

M. Escardó

引用次数: 38

Abstract

Perhaps surprisingly, there are infinite sets that admit mechanical exhaustive search in finite time. We investigate three related questions: What kinds of infinite sets admit mechanical exhaustive search in finite time? How do we systematically build such sets? How fast can exhaustive search over infinite sets be performed?

查看原文本刊更多论文

允许快速穷举搜索的无限集

也许令人惊讶的是，存在允许在有限时间内进行机械穷举搜索的无限集。我们研究了三个相关的问题:什么类型的无限集允许在有限时间内进行机械穷举搜索?我们如何系统地构建这样的集合?在无限集上进行穷举搜索的速度有多快?

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)

自引率

0.00%

发文量