The Kahr-Moore-Wang Class Contains Untestable Properties.

BALTIC JOURNAL OF MODERN COMPUTING(2016)

引用 0|浏览0
暂无评分
摘要
Property testing is a kind of randomized approximation in which one takes a small, random sample of a structure and wishes to determine whether the structure satisfies some property or is far from satisfying the property. We focus on the testability of classes of first-order expressible properties, and in particular, on the classification of prefix-vocabulary classes for testability. The main result is the untestability of [for all there exists for all, (0, 1)](=). We also show that this class remains untestable without equality in at least one model of testing. These classes are well-known and (at least one is) minimal for untestability. We discuss what is currently known about the classification for testability and briefly compare it to other classifications.
更多
查看译文
关键词
property testing,logic,randomized algorithms,Kahr-Moore-Wang class
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要