An Informal Arithmetical Approach to Computability and Computation

DOI10.4153/CMB-1961-031-9MaRDI QIDQ5719672zbMATH OpenOpenAlexWikidataFDO

Authors Z. A. Melzak

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

zbMATH Keywords

numerical analysis

Cited in

(9)

• The developments of the concept of machine computability from 1936 to the 1960s
• Theoretical computer science: computability, decidability and logic
• A survey of state vectors
• Existential arithmetization of Diophantine equations
• A direct method for simulating partial recursive functions by Diophantine equations
• The Riemann hypothesis in computer science
• Register machine proof of the theorem on exponential diophantine representation of enumerable sets
• Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic
• On some algebraic ways to calculate zeros of the Riemann zeta function

This page was built for publication: An Informal Arithmetical Approach to Computability and Computation

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