An Informal Arithmetical Approach to Computability and Computation
From MaRDI portal
Publication:5719672
DOI10.4153/CMB-1961-031-9zbMath0112.35703OpenAlexW2333456792WikidataQ62072895 ScholiaQ62072895MaRDI QIDQ5719672
Publication date: 1961
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cmb-1961-031-9
Related Items (8)
A direct method for simulating partial recursive functions by Diophantine equations ⋮ Register machine proof of the theorem on exponential diophantine representation of enumerable sets ⋮ On some algebraic ways to calculate zeros of the Riemann zeta function ⋮ A survey of state vectors ⋮ Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic ⋮ The Riemann hypothesis in computer science ⋮ Existential arithmetization of Diophantine equations ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s
This page was built for publication: An Informal Arithmetical Approach to Computability and Computation
