On the complexity of computable real sequences
Jacobo Torán (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On algebraic specifications of computable algebras with the discriminator technique”
On the complexity of computable real sequences
A note on fixpoint techniques in data base recursive logic programs
Irène Guessarian (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Algebraic definition of a functional programming language and its semantic models
Manfred Broy, Martin Wirsing (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On clones determined by their initial segments
J. Sichler, V. Trnková (2008)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
Undecidable event detection problems for ODEs of dimension one and two
Keijo Ruohonen (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
CPO-models for second order lambda calculus with recursive types and subtyping
E. Poll, C. Hemerik, H. M. M. Ten Eikelder (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Nondeterminism and fully abstract models
Egidio Astesiano, Gerardo Costa (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: