English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

In this paper we study subsequences of random numbers. In Kamae (1973),selection functions that depend only on coordinates are studied, and theirnecessary and sufficient condition for the selected sequences to be normalnumbers is given. In van Lambalgen (1987), an algorithmic analogy to thetheorem is conjectured in terms of algorithmic randomness and Kolmogorovcomplexity. In this paper, we show different algorithmic analogies to thetheorem.

Algorithmic analogies to kamae-Weiss theorem on normal numbers