Just to make clear that a memory bound and
data efficiency are two different issues.
A memory bounded program in a procedural
language can efficiently represent data up
to its memory bound (e.g., 10^124 bits).
But it cannot represent data that exceeds
its memory bound and will not be able to
generalize beyond its bound.
Translating a memory bounded program (in a
procedural language) into an MDP
representation as a set of states and
probabilities of state transitions will be
data inefficient.
Cheers,
Bill
>> email to
magic-list+...@googlegroups.com.
> To unsubscribe from this group and stop receiving emails from it, send an email to
magic-list+...@googlegroups.com.