It seems your post is not suited for this venue...
In article <462aa1f3-2745-4620-a9a5-44de11ce40f6@s1g2000prd.googlegroups.com>, Martin Musatov <marty.musatov@gmail.com> wrote:
> theoretical Computer.Let  be a language. Then L  >  be a > language in x  L halts for the Computer, then x >  {{x}} >  L halts in Polynomial time.Let y  > halts in
