Can probabilistic Turing machines be considered a generalization of deterministic Turing machines, so that DTMs can be described in terms of PTMs?

Editing in reply to your edit: I thought Solomonoff Induction was made for a purpose. Quoting from Legg's paper:

Solomonoff's induction method is an attempt to design a general all purpose inductive inference system. Ideally such a system would be able to accurately learn any meaningful hypothesis from a bare minimum of appropriately format- ted information.

I'm just pointing out what I see as a limitation in the domain of problems classical Solomonoff Induction can successfully model.