| Publication | Date of Publication | Type |
|---|
Theory of computation over stream algebras, and its applications
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Tracking computability of GPAC-generable functions
Journal Of Logic And Computation | 2022-02-08 | Paper |
Tracking computability of GPAC-generable functions
| 2020-05-06 | Paper |
Feferman on computability
Outstanding Contributions to Logic | 2020-02-05 | Paper |
Approximability in the GPAC
| 2019-09-13 | Paper |
Analog networks on function data streams
Computability | 2019-03-20 | Paper |
Generalizing Computability Theory to Abstract Algebras
Turing’s Revolution | 2018-04-18 | Paper |
Examples of semicomputable sets of real and complex numbers
Lecture Notes in Computer Science | 2017-11-17 | Paper |
Abstract versus concrete computation on metric partial algebras
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Abstract computability and algebraic specification
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
Fixed Point Techniques in Analog Systems
Mathematical and Computational Approaches in Advancing Modern Science and Engineering | 2017-02-03 | Paper |
Assignment calculus: a pure imperative language
Logical Foundations of Computer Science | 2015-12-11 | Paper |
Models of computation for partial functions on the reals
Journal of Logical and Algebraic Methods in Programming | 2015-02-27 | Paper |
Characterizations of semicomputable sets of real numbers
Journal of Logical and Algebraic Methods in Programming | 2014-12-03 | Paper |
Computability of operators on continuous and discrete time streams
Computability | 2014-06-19 | Paper |
Continuity of operators on continuous and discrete time streams
Theoretical Computer Science | 2011-07-07 | Paper |
Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms
Applied Mathematics and Computation | 2009-11-13 | Paper |
Primitive recursive selection functions for existential assertions over abstract algebras
The Journal of Logic and Algebraic Programming | 2008-09-01 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Computability of analog networks
Theoretical Computer Science | 2007-03-12 | Paper |
Universality and semicomputability for nondeterministic programming languages over abstract algebras
The Journal of Logic and Algebraic Programming | 2007-02-09 | Paper |
Abstract versus concrete computability: the case of countable algebras
| 2006-07-03 | Paper |
scientific article; zbMATH DE number 5033764 (Why is no real title available?)
| 2006-06-19 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
The Journal of Logic and Algebraic Programming | 2005-02-22 | Paper |
scientific article; zbMATH DE number 1870421 (Why is no real title available?)
| 2003-02-18 | Paper |
Computation by `While' programs on topological partial algebras
Theoretical Computer Science | 1999-06-21 | Paper |
scientific article; zbMATH DE number 1086637 (Why is no real title available?)
| 1998-04-03 | Paper |
Transformations of normal and inverted function tables
Formal Aspects of Computing | 1997-02-04 | Paper |
scientific article; zbMATH DE number 785052 (Why is no real title available?)
| 1995-08-14 | Paper |
scientific article; zbMATH DE number 432708 (Why is no real title available?)
| 1993-11-11 | Paper |
scientific article; zbMATH DE number 192929 (Why is no real title available?)
| 1993-06-05 | Paper |
scientific article; zbMATH DE number 177847 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 88946 (Why is no real title available?)
| 1993-01-16 | Paper |
PROJECTIONS OF SEMICOMPUTABLE RELATIONS ON ABSTRACT DATA TYPES
International Journal of Foundations of Computer Science | 1992-09-27 | Paper |
Deterministic and nondeterministic computation, and horn programs, on abstract data types
The Journal of Logic Programming | 1992-08-13 | Paper |
scientific article; zbMATH DE number 39877 (Why is no real title available?)
| 1992-08-03 | Paper |
scientific article; zbMATH DE number 4125019 (Why is no real title available?)
| 1989-01-01 | Paper |
Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
Journal of Computer and System Sciences | 1988-01-01 | Paper |
scientific article; zbMATH DE number 3980464 (Why is no real title available?)
| 1986-01-01 | Paper |
Corrigendum: On infinite computations in denotational semantics
Theoretical Computer Science | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3890714 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3802792 (Why is no real title available?)
| 1983-01-01 | Paper |
On infinite computations in denotational semantics
Theoretical Computer Science | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3817028 (Why is no real title available?)
| 1983-01-01 | Paper |
Processes and the denotational semantics of concurrency
Information and Control | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3750266 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3755837 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3653502 (Why is no real title available?)
| 1979-01-01 | Paper |
The adequacy problem for inferential logic
Journal of Philosophical Logic | 1978-01-01 | Paper |
The adequacy problem for classical logic
Journal of Philosophical Logic | 1978-01-01 | Paper |
