Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. III (Q1118677): Difference between revisions

[For part II, cf. J. Algebra 97, 278-285 (1985; Zbl 0579.20031).] The authors give the construction of a finitely presented Lie algebra over a field of characteristic different from 2 which is 3-step soluble, with insoluble word problem. The authors notice that they were strongly influenced by the analogous result for groups due to O. G. Kharlampovich. They also indicate some flaws in the original example of \textit{G. P. Kukin} [Sib. Mat. J. 24, 221-231 (1983); translation from Sib. Math. Zh. 24, No.2, 85-96 (1983; Zbl 0519.17009)]. Using their basic construction the authors prove the undecidability of some other algorithmic problems in the class of finitely presented 3-step soluble Lie algebras, e.g. the isomorphism problem, etc. As in the group theory case, the authors make use of so-called Minsky routines, the graph-theoretic equivalent of a device traditionally called a programmed Minsky 2-type machine.