The following pages link to How to Program an Infinite Abacus (Q3848975):
Displaying 24 items.
- Applicability conditions for plans with loops: computability results and algorithms (Q359973) (← links)
- A survey of state vectors (Q458456) (← links)
- Proving program inclusion using Hoare's logic (Q789887) (← links)
- Average case optimality for linear problems (Q796299) (← links)
- Existential arithmetization of Diophantine equations (Q1006616) (← links)
- Decision problems for propositional linear logic (Q1192352) (← links)
- A direct method for simulating partial recursive functions by Diophantine equations (Q1326783) (← links)
- On the decision problem for MELL (Q1733062) (← links)
- Linear logic automata (Q1919766) (← links)
- Word problem for knotted residuated lattices. (Q2254319) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- The Riemann hypothesis in computer science (Q2286749) (← links)
- Some definitional suggestions for automata theory (Q2529464) (← links)
- Programs=data=first-class citizens in a computational world (Q2941589) (← links)
- Register machine proof of the theorem on exponential diophantine representation of enumerable sets (Q3734384) (← links)
- Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic (Q4372922) (← links)
- (Q4826149) (← links)
- The undecidability of second order linear logic without exponentials (Q4894725) (← links)
- System NEL is Undecidable (Q4924537) (← links)
- Aspects of Categorical Recursion Theory (Q5014598) (← links)
- MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE (Q5100054) (← links)
- The Developments of the Concept of Machine Computability from 1936 to the 1960s (Q5250213) (← links)
- Chasing Diagrams in Cryptography (Q5414973) (← links)
- Hierarchical decompositions and termination analysis for generalized planning (Q6488800) (← links)
