| Publication | Date of Publication | Type |
|---|
| Finite approximations of the common meadow of rational numbers | 2025-10-29 | Paper |
Logical models of mathematical texts. II: legality conventions for division by zero in inconsistent contexts
Journal of Logic, Language and Information | 2025-10-21 | Paper |
For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvability
Theoretical Computer Science | 2025-03-11 | Paper |
A complete finite axiomatisation of the equational theory of common meadows
ACM Transactions on Computational Logic | 2025-02-14 | Paper |
Logical models of mathematical texts: the case of conventions for division by zero.
Journal of Logic, Language and Information | 2025-01-13 | Paper |
Which arithmetical data types admit fracterm flattening?
Scientific Annals of Computer Science | 2024-08-15 | Paper |
Symmetric transrationals: the data type and the algorithmic degree of its equational theory
Lecture Notes in Computer Science | 2023-07-26 | Paper |
Eager Equality for Rational Number Arithmetic
ACM Transactions on Computational Logic | 2023-07-18 | Paper |
Partial arithmetical data types of rational numbers and their equational specification
Journal of Logical and Algebraic Methods in Programming | 2022-08-26 | Paper |
Theory of computation over stream algebras, and its applications
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
A model of systems with modes and mode transitions
Journal of Logical and Algebraic Methods in Programming | 2022-05-25 | Paper |
| The wheel of rational numbers as an abstract data type | 2021-10-27 | Paper |
An algebraic theory for data linkage
(available as arXiv preprint) | 2020-06-08 | Paper |
| An algebraic theory for data linkage | 2020-06-08 | Paper |
A hierarchy for BPP//log\(\star\) based on counting calls to an oracle
Emergent Computation | 2018-10-04 | Paper |
Generalizing Computability Theory to Abstract Algebras
Turing’s Revolution | 2018-04-18 | Paper |
Computations with oracles that measure vanishing quantities
Mathematical Structures in Computer Science | 2017-11-22 | 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 |
Axiomatizing physical experiments as oracles to algorithms
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2015-08-21 | Paper |
Three forms of physical measurement and their computability
The Review of Symbolic Logic | 2015-03-02 | Paper |
An analogue-digital Church-Turing thesis
International Journal of Foundations of Computer Science | 2014-11-14 | Paper |
Computability of operators on continuous and discrete time streams
Computability | 2014-06-19 | Paper |
Oracles that measure thresholds: the Turing machine and the broken balance
Journal Of Logic And Computation | 2014-04-01 | Paper |
On the Power of Threshold Measurements as Oracles
Unconventional Computation and Natural Computation | 2013-06-28 | Paper |
Stability for effective algebras
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
The impact of models of a physical oracle on computational power
MSCS. Mathematical Structures in Computer Science | 2012-10-23 | Paper |
Continuity of operators on continuous and discrete time streams
Theoretical Computer Science | 2011-07-07 | Paper |
Stability of representations of effective partial algebras
Mathematical Logic Quarterly | 2011-05-06 | Paper |
Limits to measurement in experiments governed by algorithms
Mathematical Structures in Computer Science | 2010-12-14 | Paper |
Physical oracles: the Turing machine and the Wheatstone bridge
Studia Logica | 2010-12-01 | Paper |
Computational complexity with experiments as oracles. II. Upper bounds
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2010-05-19 | Paper |
Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms
Applied Mathematics and Computation | 2009-11-13 | Paper |
Computations via Newtonian and relativistic kinematic systems
Applied Mathematics and Computation | 2009-11-13 | Paper |
Division safe calculation in totalised fields
Theory of Computing Systems | 2009-05-08 | Paper |
Meadows and the equational specification of division
Theoretical Computer Science | 2009-03-25 | Paper |
Computational complexity with experiments as oracles
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2009-01-23 | Paper |
| Skew Meadows | 2009-01-07 | Paper |
The rational numbers as an abstract data type
Journal of the ACM | 2008-12-21 | Paper |
Oracles and Advice as Measurements
Unconventional Computing | 2008-12-02 | Paper |
Programming Experimental Procedures for Newtonian Kinematic Machines
Logic and Theory of Algorithms | 2008-06-19 | Paper |
On the Complexity of Measurement in Classical Physics
Lecture Notes in Computer Science | 2008-05-27 | Paper |
| Computability on topological spaces via domain representations | 2008-04-29 | Paper |
Fields, Meadows and Abstract Data Types
Pillars of Computer Science | 2008-03-25 | Paper |
Experimental computation of real numbers by Newtonian machines
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2008-02-08 | Paper |
Elementary Algebraic Specifications of the Rational Complex Numbers
Algebra, Meaning, and Computation | 2007-09-07 | Paper |
Computability of analog networks
Theoretical Computer Science | 2007-03-12 | Paper |
Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
Theoretical Computer Science | 2007-03-12 | Paper |
Embedding infinitely parallel computation in Newtonian kinematics
Applied Mathematics and Computation | 2006-08-04 | Paper |
| Abstract versus concrete computability: the case of countable algebras | 2006-07-03 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
CONSTRUCTIVE VOLUME GEOMETRY APPLIED TO VISUALIZATION OF CARDIAC ANATOMY AND ELECTROPHYSIOLOGY
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering | 2005-03-08 | Paper |
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
The Journal of Logic and Algebraic Programming | 2005-02-22 | Paper |
Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
The Bulletin of Symbolic Logic | 2005-02-09 | Paper |
The algebraic structure of interfaces
Science of Computer Programming | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 1870421 (Why is no real title available?) | 2003-02-18 | Paper |
Hierarchical reconstructions of cardiac tissue
Chaos, Solitons and Fractals | 2002-08-18 | Paper |
Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
Theoretical Computer Science | 2002-07-31 | Paper |
Coupled map lattices as computational systems
Chaos: An Interdisciplinary Journal of Nonlinear Science | 2001-01-16 | Paper |
| scientific article; zbMATH DE number 1390022 (Why is no real title available?) | 2000-09-20 | Paper |
Concrete models of computation for topological algebras
Theoretical Computer Science | 1999-06-21 | Paper |
Computation by `While' programs on topological partial algebras
Theoretical Computer Science | 1999-06-21 | Paper |
Reconstructing the heart
Chaos, Solitons and Fractals | 1999-03-04 | Paper |
Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
Journal of the ACM | 1998-01-28 | Paper |
| scientific article; zbMATH DE number 1107561 (Why is no real title available?) | 1998-01-21 | Paper |
AN ALGORITHMIC MODEL OF THE MAMMALIAN HEART: PROPAGATION, VULNERABILITY, RE-ENTRY AND FIBRILLATION
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering | 1997-12-08 | Paper |
Algebraic models of microprocessors architecture and organisation
Acta Informatica | 1996-11-21 | Paper |
| scientific article; zbMATH DE number 785052 (Why is no real title available?) | 1995-08-14 | Paper |
Coupling CMLs and the synchronization of a multilayer neural computing system
Chaos, Solitons and Fractals | 1995-06-30 | Paper |
The data type variety of stack algebras
Annals of Pure and Applied Logic | 1995-05-30 | 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 139814 (Why is no real title available?) | 1993-03-28 | 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 |
Algebraic and fixed point equations over inverse limits of algebras
Theoretical Computer Science | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4125019 (Why is no real title available?) | 1989-01-01 | Paper |
The concurrent assignment representation of synchronous systems
Parallel Computing | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4096757 (Why is no real title available?) | 1988-01-01 | Paper |
Complete local rings as domains
Journal of Symbolic Logic | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3997157 (Why is no real title available?) | 1987-01-01 | Paper |
Algebraic specifications of computable and semicomputable data types
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3928334 (Why is no real title available?) | 1985-01-01 | Paper |
Top-down design and the algebra of communicating processes
Science of Computer Programming | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3862421 (Why is no real title available?) | 1984-01-01 | Paper |
Hoare's logic for programming languages with two data types
Theoretical Computer Science | 1984-01-01 | Paper |
The axiomatic semantics of programs based on Hoare's logic
Acta Informatica | 1984-01-01 | Paper |
Hoare's logic and Peano's arithmetic
Theoretical Computer Science | 1983-01-01 | Paper |
Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
SIAM Journal on Computing | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3795350 (Why is no real title available?) | 1982-01-01 | Paper |
Expressiveness and the completeness of Hoare's logic
Journal of Computer and System Sciences | 1982-01-01 | Paper |
Floyd's principle, correctness theories and program equivalence
Theoretical Computer Science | 1982-01-01 | Paper |
Two theorems about the completeness of Hoare's logic
Information Processing Letters | 1982-01-01 | Paper |
Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
Theoretical Computer Science | 1982-01-01 | Paper |
The completeness of the algebraic specification methods for computable data types
Information and Control | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3723836 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3713172 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3713173 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3729430 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3703962 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3645075 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3683036 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3688693 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3671657 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3655327 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3655328 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3662553 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3700187 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3683037 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3700186 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3724432 (Why is no real title available?) | 1980-01-01 | Paper |
Finite alogorithmic procedures and computation theories.
MATHEMATICA SCANDINAVICA | 1980-01-01 | Paper |
Computability and the algebra of fields: Some affine constructions
Journal of Symbolic Logic | 1980-01-01 | Paper |
Computing Roots of Unity in Fields
Bulletin of the London Mathematical Society | 1980-01-01 | Paper |
Finite alogorithmic procedures and inductive definability.
MATHEMATICA SCANDINAVICA | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3649971 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3653518 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3651723 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3651720 (Why is no real title available?) | 1979-01-01 | Paper |
