Quantificational variants on the halting problem for turing machines

DOI10.1002/malq.19690151302zbMath0193.31701OpenAlexW2021444653MaRDI QIDQ5588650

Patrick C. Fischer

Publication date: 1969

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19690151302

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (3)

Decision problems for tag systems ⋮ Degrees of unsolvability associated with Markov algorithms ⋮ A decision procedure using discrete geometry

This page was built for publication: Quantificational variants on the halting problem for turing machines