How to Program an Infinite Abacus
From MaRDI portal
Publication:3848975
DOI10.4153/CMB-1961-032-6zbMath0112.00902OpenAlexW2054548224WikidataQ62072894 ScholiaQ62072894MaRDI QIDQ3848975
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-032-6
Related Items (24)
A direct method for simulating partial recursive functions by Diophantine equations ⋮ Register machine proof of the theorem on exponential diophantine representation of enumerable sets ⋮ Applicability conditions for plans with loops: computability results and algorithms ⋮ Linear logic automata ⋮ Programs=data=first-class citizens in a computational world ⋮ MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE ⋮ On some algebraic ways to calculate zeros of the Riemann zeta function ⋮ A survey of state vectors ⋮ The undecidability of second order linear logic without exponentials ⋮ On the decision problem for MELL ⋮ Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic ⋮ Decision problems for propositional linear logic ⋮ Chasing Diagrams in Cryptography ⋮ Word problem for knotted residuated lattices. ⋮ The scope of Gödel's first incompleteness theorem ⋮ System NEL is Undecidable ⋮ Unnamed Item ⋮ The Riemann hypothesis in computer science ⋮ Existential arithmetization of Diophantine equations ⋮ Some definitional suggestions for automata theory ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ Proving program inclusion using Hoare's logic ⋮ Average case optimality for linear problems ⋮ Aspects of Categorical Recursion Theory
This page was built for publication: How to Program an Infinite Abacus
