Modular machines, undecidability and incompleteness
Part of the Lecture Notes in Computer Science book series (LNCS, volume 171)
Section III: Automata And Machines
KeywordsWord Problem Turing Machine Recursive Function Remainder Function Incompleteness Theorem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.S.Aanderaa and D.E.Cohen, Modular machines, the word problem for finitely presented groups and Collins' theorem, Word Problems II;the Oxford Book (North-Holland,1980),1–16.Google Scholar
- 2.S.Aanderaa and D.E.Cohen, Modular machines and the Higman-Clapham-Valiev embedding theorem, Word Problems II;the Oxford Book (North-Holland,1980),17–28.Google Scholar
- 3.D.E. Cohen, Degree problems for modular machines, J.Symbolic Logic 45(1980),510–528.Google Scholar
- 4.M.Machtey and P.Young, An Introduction to the General Theory of Algorithms, North-Holland,1978.Google Scholar
- 5.M.L. Minsky, Recursive unsolvability of Post's problem of ‘Tag’ and other topics in the theory of Turing machines, Annals of Math. 74(1961),437–455.Google Scholar
© Springer-Verlag Berlin Heidelberg 1984