The following pages link to J. V. Tucker (Q549206):
Displayed 50 items.
- Continuity of operators on continuous and discrete time streams (Q549207) (← links)
- Physical oracles: the Turing machine and the Wheatstone bridge (Q609645) (← links)
- Two theorems about the completeness of Hoare's logic (Q794426) (← links)
- Expressiveness and the completeness of Hoare's logic (Q800082) (← links)
- The axiomatic semantics of programs based on Hoare's logic (Q800712) (← links)
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions? (Q870250) (← links)
- Computability of analog networks (Q870263) (← links)
- Meadows and the equational specification of division (Q1006649) (← links)
- Division safe calculation in totalised fields (Q1015383) (← links)
- Computations via Newtonian and relativistic kinematic systems (Q1036523) (← links)
- Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms (Q1036533) (← links)
- Hoare's logic for programming languages with two data types (Q1056220) (← links)
- Top-down design and the algebra of communicating processes (Q1084850) (← links)
- Algebraic specifications of computable and semicomputable data types (Q1098613) (← links)
- The concurrent assignment representation of synchronous systems (Q1116329) (← links)
- Floyd's principle, correctness theories and program equivalence (Q1158948) (← links)
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs (Q1163369) (← links)
- Hoare's logic and Peano's arithmetic (Q1170877) (← links)
- Algebraic and fixed point equations over inverse limits of algebras (Q1177146) (← links)
- Reconstructing the heart (Q1266852) (← links)
- Concrete models of computation for topological algebras (Q1292413) (← links)
- Computation by `While' programs on topological partial algebras (Q1292414) (← links)
- Coupling CMLs and the synchronization of a multilayer neural computing system (Q1343092) (← links)
- Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. (Q1607287) (← links)
- Hierarchical reconstructions of cardiac tissue (Q1610091) (← links)
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems (Q1764798) (← links)
- Algebraic models of microprocessors architecture and organisation (Q1815999) (← links)
- The algebraic structure of interfaces (Q1887174) (← links)
- The data type variety of stack algebras (Q1891249) (← links)
- A model of systems with modes and mode transitions (Q2141292) (← links)
- Partial arithmetical data types of rational numbers and their equational specification (Q2168794) (← links)
- An algebraic theory for data linkage (Q2185883) (← links)
- The wheel of rational numbers as an abstract data type (Q2237335) (← links)
- Embedding infinitely parallel computation in Newtonian kinematics (Q2497873) (← links)
- The impact of models of a physical oracle on computational power (Q2919942) (← links)
- AN ANALOGUE-DIGITAL CHURCH-TURING THESIS (Q2929623) (← links)
- Axiomatizing physical experiments as oracles to algorithms (Q2941593) (← links)
- Stability of representations of effective partial algebras (Q2996232) (← links)
- (Q3050415) (← links)
- Limits to measurement in experiments governed by algorithms (Q3061157) (← links)
- (Q3138835) (← links)
- (Q3208066) (← links)
- (Q3330491) (← links)
- On the Complexity of Measurement in Classical Physics (Q3502630) (← links)
- Programming Experimental Procedures for Newtonian Kinematic Machines (Q3507418) (← links)
- Oracles and Advice as Measurements (Q3543332) (← links)
- The rational numbers as an abstract data type (Q3546326) (← links)
- Computational complexity with experiments as oracles. II. Upper bounds (Q3561915) (← links)
- The completeness of the algebraic specification methods for computable data types (Q3659115) (← links)
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems (Q3662597) (← links)