Computability by Normal Algorithms

DOI10.2307/2035697MaRDI QIDQ5566513zbMATH OpenOpenAlexFDO

Authors Robert M. Baer

Publication date 1969

Full work available at URL https://doi.org/10.2307/2035697

zbMATH Keywords

recursion theory, constructive mathematics

Cites work

• Computability of Recursive Functions
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines

Cited in

(2)

• ET and an infinitary Church's thesis
• Computation by assembly

This page was built for publication: Computability by Normal Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5566513)