.png){kind=icon}
返回
Creating and detecting specious randomness
.png){kind=icon}
OA
AI
DOI：10.1140/epjqt/s40507-022-00158-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a new test of non-randomness that tests both the lower and the upper critical limit of a chi 2-statistic. While checking the upper critical value has been employed by other tests, we argue that also the lower critical value should be examined for non-randomness. To this end, we prepare a binary sequence where all possible bit strings of a certain length occurs the same number of times and demonstrate that such sequences pass a well-known suite of tests for non-randomness. We show that such sequences can be compressed, and therefore are somewhat predictable and thus not fully random. The presented test can detect such non-randomness, and its novelty rests on analysing fixed-length bit string frequencies that lie closer to the a priori probabilities than could be expected by chance alone.
Keyword:
Randomness
Randomness test
Data compression
期刊
IF:
5.6
论文数:
538
被引数:
1.1K
机构
引用论文
Reliability and construct validity of the Automated Neuropsychological Assessment Metrics (ANAM) mood scale自动神经心理学评估指标 (ANAM) 情绪量表的信度和结构效度OAAI
OAAI分享收藏The C‐terminal segment of collagenase in Grimontia hollisae binds collagen to enhance collagenolysis
OAAI
OAAI分享收藏The complete genome sequence of the Gram-positive bacterium Bacillus subtilis革兰氏阳性细菌枯草芽孢杆菌的全基因组序列.png)
NatureOAAI
NatureIF0
OAAI分享收藏 没有更多内容
没有更多内容