Yes—this is specifically staying within the framework of hidden markov chains.
Even if you go outside though it seems you agree there is a generative predictive gap—you’re just saying it’s not infinite.
Eggsyntax below gives the canonical example of hash function where prediction is harder than generation which hold for general computable processes.
Yes—this is specifically staying within the framework of hidden markov chains.
Even if you go outside though it seems you agree there is a generative predictive gap—you’re just saying it’s not infinite.
Eggsyntax below gives the canonical example of hash function where prediction is harder than generation which hold for general computable processes.