How to Program an Infinite Abacus
From MaRDI portal
Cited in
(26)- Existential arithmetization of Diophantine equations
- Decision problems for propositional linear logic
- A direct method for simulating partial recursive functions by Diophantine equations
- On the decision problem for MELL
- Linear logic automata
- Word problem for knotted residuated lattices.
- The scope of Gödel's first incompleteness theorem
- The Riemann hypothesis in computer science
- Some definitional suggestions for automata theory
- Programs=data=first-class citizens in a computational world
- Applicability conditions for plans with loops: computability results and algorithms
- 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
- A survey of state vectors
- scientific article; zbMATH DE number 2114479 (Why is no real title available?)
- The undecidability of second order linear logic without exponentials
- System NEL is undecidable
- Aspects of categorical recursion theory
- MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE
- The developments of the concept of machine computability from 1936 to the 1960s
- Chasing diagrams in cryptography
- On some algebraic ways to calculate zeros of the Riemann zeta function
- Hierarchical decompositions and termination analysis for generalized planning
- Computing tools and representations of arithmetic
- Proving program inclusion using Hoare's logic
- Average case optimality for linear problems
This page was built for publication: How to Program an Infinite Abacus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3848975)
