Be A = { | n N} a countable set of Stockitems. and

= { φ | φ is a formula with stockitems of A. }

Find a finite alphabet Σ, a embedding i : --> Σ*

and a deterministic - time- turing machine M (for adequate k N, so A(M) = {i(φ|φ }.

A rough sketch of the turingprogramm is enough. I have to give an estimation up for the runtime of my program.

Can someone help me, I dont even know how to start this exercise

Every help would be appreciated