Weak but Not Strong Asymptotic Testability

We construct two fixed disjoint families $H_0,H_1$ of stationary ergodic binary process distributions for which a weakly asymptotically consistent test exists, but no strongly asymptotically consistent test exists.

The construction combines a synchronizing binary suspension code, an independent i.i.d marker process, and countably many independent slowly switching two-state Markov chains.

In particular, this disproves the asymptotic-consistency branch of a conjecture of Ryabko.