John V. Tucker

Q: What Schools Are Affiliated With John V. Tucker

John V. Tucker is affiliated with the following schools: University of Warwick, University of Bristol, University of Wales

John V. Tucker's AcademicInfluence.com Rankings

John V. Tucker

Computer Science

#1143

World Rank

#1183

Historical Rank

Database

#3550

World Rank

#3699

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is John V. Tucker Influential?

(Suggest an Edit or Addition)

According to Wikipedia, John Vivian Tucker is a British computer scientist and expert on computability theory, also known as recursion theory. Computability theory is about what can and cannot be computed by people and machines. His work has focused on generalising the classical theory to deal with all forms of discrete/digital and continuous/analogue data; and on using the generalisations as formal methods for system design; based on abstract data types and on the interface between algorithms and physical equipment.

(See a Problem?)

John V. Tucker's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Constructive Volume Geometry (2000) (141)
Algebraic Specifications of Computable and Semicomputable Data Types (1987) (126)
The rational numbers as an abstract data type (2007) (122)
Universal algebra (1993) (105)
Computable functions and semicomputable sets on many-sorted algebras (2001) (104)
Program correctness over abstract data types, with error-state semantics (1988) (98)
Effective algebras (1995) (96)
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method (1980) (95)
Equational specifications, complete term rewriting systems, and computable and semicomputable algebras (1995) (78)
Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems (1983) (76)
Abstract versus concrete computation on metric partial algebras (2001) (67)
Computable Rings and Fields (1999) (66)
Concrete Models of Computation for Topological Algebras (1999) (66)
A characterization of computable data types by means of a finite, equational specification mehod (1980) (60)
Many-sorted logic and its applications (1993) (59)
Meadows and the equational specification of division (2009) (58)
Complete local rings as domains (1988) (55)
Top-Down Design and the Algebra of Communicating Processes (1985) (53)
Computational complexity with experiments as oracles (2008) (51)
Expressiveness and the Completeness of Hoare's Logic (1982) (49)
The Completeness of the Algebraic Specification Methods for Computable Data Types (1982) (47)
Process Algebra with Asynchronous Communication Mechanisms (1984) (46)
Division Safe Calculation in Totalised Fields (2008) (45)
On Phatic Technologies for Creating and Maintaining Human Relationships (2011) (45)
On the Power of Algebraic Specifications (1981) (42)
Coupled map lattices as computational systems. (1992) (41)
Can excitable media be considered as computational systems (1991) (41)
Can Newtonian systems, bounded in space, time, mass and energy compute all functions? (2007) (37)
Experimental computation of real numbers by Newtonian machines (2007) (37)
Computation by 'While' Programs on Topological Partial Algebras (1999) (37)
COMPUTING IN ALGEBRAIC SYSTEMS (1978) (34)
Computational complexity with experiments as oracles. II. Upper bounds (2009) (32)
Limits to measurement in experiments governed by algorithms† (2009) (30)
Embedding infinitely parallel computation in Newtonian kinematics (2006) (29)
The concurrent assignment representation of synchronous systems (1987) (28)
The impact of models of a physical oracle on computational power† (2012) (28)
Sets: Naïve, Axiomatic and Applied (1979) (27)
Axiomatizing physical experiments as oracles to algorithms (2012) (26)
Practice Makes Perfect: Knowledge of Materials in Classical Athens (2002) (25)
Computable Functions on Stream Algebras (1995) (25)
Computability of analog networks (2007) (25)
Algebraic Models and the Correctness of Microprocessors (1993) (24)
Phatic Technologies in Modern Society (2012) (24)
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems (2005) (24)
Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs (1982) (23)
Prospects for Hardware Foundations (2002) (23)
Physical Oracles: The Turing Machine and the Wheatstone Bridge (2010) (21)
Oracles and Advice as Measurements (2008) (21)
Computational Models of Measurement and Hempel’s Axiomatization (2010) (21)
Computations via experiments with kinematic systems 1 (2004) (20)
THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY (2014) (20)
Computable and continuous partial homomorphisms on metric partial algebras (2003) (20)
Hierarchical reconstructions of cardiac tissue (2002) (19)
AN ALGORITHMIC MODEL OF THE MAMMALIAN HEART: PROPAGATION, VULNERABILITY, RE-ENTRY AND FIBRILLATION (1996) (19)
On the Complexity of Measurement in Classical Physics (2008) (19)
Hoare's Logic and Peano's Arithmetic (1983) (19)
Floyds Principle, Correctness Theories and Program Equivalence (1982) (19)
Theory of Computation over Stream Algebras, and its Applications (1992) (18)
Algebraic and Fixed Point Equations over Inverse Limits of Algebras (1991) (18)
Provable computable selection functions of abstract structures (1993) (18)
Domain representations of partial functions, with applications to spatial objects and constructive volume geometry (2002) (17)
Verification of Synchronous Concurrent Algorithms Using OBJ3: A Case Study of the Pixel-Planes Architecture (1991) (17)
Oracles that measure thresholds: the Turing machine and the broken balance (2013) (17)
Two Theorems About the Completeness of Hoare's Logic (1982) (16)
Elementary Algebraic Specifications of the Rational Complex Numbers (2006) (16)
A natural data type with a finite equational final semantics specifcation, but no effective equational initial specification (1979) (16)
Infinite Systems of Equations over Inverse Limits and Infinite Synchronous Concurrent Algorithms (1992) (16)
A Data Type Variety of Stack Algebras (1995) (15)
Theory of Computation and Specification over Abstract Data Types, and its Applications (1991) (15)
Theoretical Considerations in Algorithm Design (1985) (15)
An analogue-Digital Church-Turing Thesis (2014) (15)
Examples of Semicomputable Sets of Real and Complex Numbers (1992) (15)
Theoretical Foundations of VLSI Design (1991) (15)
Initial and final algebra semantics for data type specifications: two characterisation theorems : (preprint) (1980) (14)
Algebraic Tools for System Construction (1983) (14)
Abstract computability and algebraic specification (2002) (14)
Algebraically Specified Programming Systems and Hoare's Logic (1981) (14)
The completeness of the algebraic specification methods for data types : (preprint) (1980) (14)
Continuity of operators on continuous and discrete time streams (2011) (13)
Equational specifications for computable data types: six hidden functions suffice and other sufficiency bounds : (preprint) (1993) (13)
Reconstructing the heart (1994) (13)
Constructive Representations of Volumetric Environments (2000) (13)
Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data Types (1992) (12)
Specification, Derivation and Verification of Concurrent Line Drawing Algorithms and Architectures (1988) (12)
On the adequacy of finite equational methods for data type specification (1979) (12)
Computability of Operators on Continuous and Discrete Time Streams (2014) (11)
Streams, Stream Transformers and Domain Representations (1998) (11)
Coupling CMLs and the synchronization of a multilayer neural computing system (1994) (11)
Introduction to Mathematical Logic (1979) (11)
Constructive Volume Geometry Applied to Visualization of Cardiac Anatomy and Electrophysiology (2003) (11)
A natural data type with a finite equational final semantics specification but no effective equational initial semantics specification : (preprint) (1980) (11)
Computability on Topological Spaces via Domain Representations (2008) (11)
Hierarchies of Spatially Extended Systems and Synchronous Concurrent Algorithms (1998) (10)
Provable Computable Functions on Abstract Data Types (1990) (10)
Physical Experiments as Oracles (2009) (10)
Theoretical Foundations of VLSI Design: Formal specification of a digital correlator (1990) (10)
Projections of Semicomputable Relations on Abstract Data Tzpes (1991) (10)
An Analogue-Digital Model of Computation: Turing Machines with Physical Oracles (2017) (10)
Horn Programs and Semicomputable Relations on Abstract Structures (1989) (10)
Fields, Meadows and Abstract Data Types (2008) (10)
Theoretical foundations of hardware design (1990) (9)
Algebraic models of microprocessors: the correctness and verification of a simple computer (1998) (9)
Algebraic specifications of computable and semi-computable data structures : (preprint) (1979) (9)
System Documentation Using Tables - A short course (1995) (9)
Computability and the algebra of fields: Some affine constructions (1980) (9)
Programming Experimental Procedures for Newtonian Kinematic Machines (2008) (9)
The inescapable stack: an exercise in algebraic specification with total functions (1988) (8)
On the Power of Threshold Measurements as Oracles (2013) (8)
Skew Meadows (2009) (8)
Surveillance and identity: conceptual framework and formal models (2017) (8)
Computations with oracles that measure vanishing quantities (2016) (8)
A Network Model of Analogue Computation over Metric Algebras (2005) (7)
Deviance and Control in Communities with Perfect Surveillance - The Case of Second Life (2011) (7)
Phatic systems in digital society (2016) (7)
Correctness theories and program equivalence : (preprint) (1979) (7)
Logical Approaches to Computational Barriers (2006) (7)
Hoare's Logic for Programming Languages with two Data Types (1984) (7)
Automatic program translation - a third way (2004) (6)
Viewing Cybercommunities through the Lens of Modernity: The Case of Second Life (2013) (6)
Logical approaches to computational barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, Wales, July 2006, Proceedings (2006) (6)
Visualising Cardiac Anatomy Using Constructive Volume Geometry (2003) (6)
Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms (2009) (6)
The Refinement of Specifications and the Stabiliy of Hoare's Logic (1981) (6)
Abstract versus concrete computability: the case of countable algebras (2016) (6)
Services2Cloud: A Framework for Revenue Analysis of Software-as-a-Service Provisioning (2013) (5)
Computations via Newtonian and relativistic kinematic systems (2009) (5)
A Natural Computation Model of Positive Relativisation (2014) (5)
The data type of spatial objects (2013) (5)
Algebraic models of microprocessors architecture and organisation (1996) (5)
A hierarchy for BPP// log? based on counting calls to an oracle (2017) (5)
Classifying the Computational Power of Stochastic Physical Oracles (2018) (5)
Prospects for hardware foundations : ESPRIT Working Group 8533 : NADA--new hardware design methods, survey chapters (1998) (4)
The Transrational Numbers as an Abstract Data Type (2020) (4)
Excitable Media as Computational Systems (1991) (4)
Robert Recorde and the History of Computing (2011) (4)
Infinite Synchronous Concurrent Algorithms The Algebraic Specification and Verification of a Hardware Stack (1993) (4)
Theoretical framework for analysing the behaviour of real and simulated neural networks (1992) (4)
The algebraic structure of interfaces (2003) (3)
Complexity theory and the operational structure of algebraic programming systems (1982) (3)
On bounds for the specification of finite data types by means of equations and conditional equations : (preprint) (1980) (3)
Floyd's principle, correctness theories and program equivalence : (preprint) (1980) (3)
Computing Roots of Unity in Fields (1980) (3)
The axiomatic semantics of programs based on Hoare's logic (1984) (3)
Generalizing Computability Theory to Abstract Algebras (2015) (3)
‘I am not a number’: Conceptualising identity in digital surveillance (2021) (3)
Tools for the Formal Development of Rasterisation Algorithms (1989) (3)
The Wheel of Rational Numbers as an Abstract Data Type (2020) (3)
Comparing complexity classes relative to physical oracles (2009) (3)
Newtonian systems, bounded in space, time, mass and energy can compute all functions 1 (2005) (3)
Refinement of specifications and the stability of Hoare's logic (1982) (3)
The Scope and Limits of Synchronous Concurrent Computation (1988) (3)
Stability of representations of effective partial algebras (2011) (2)
Stability for Effective Algebras (2008) (2)
Elements of logic and foundations of mathematics in problems (1984) (2)
A Hierarchy for BPP //\log \!\star Based on Counting Calls to an Oracle (2017) (2)
Formalising Surveillance and Identity (2014) (2)
Toward a General Theory of Computation and Specification over Abstract Data Types (1991) (2)
Theoretical Foundations of VLSI Design: The prioritiser experiment: estimation and measurement of computation time in VLSI (1990) (2)
Applications of computability theory over abstract data types (1989) (1)
Computability of analogue networks (2005) (1)
Totalising Partial Algebras (2022) (1)
Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers (2006) (1)
Infinitary Algebraic Specifications for Stream Algebras (1998) (1)
Algebraic Specifications of Computing as a Service with Applications to Cost Analysis (2012) (1)
Origins of our Theory of Computation on Abstract Data Types at the Mathematical Centre , Amsterdam , 1979-80 (2004) (1)
A model of systems with modes and mode transitions (2021) (1)
Abstract Computability, Algebraic Specification and Initiality (2001) (1)
Monitoring and Intervention: Concepts and Formal Models (2017) (1)
Computing in algebraic systems : (preprint) (1980) (1)
On bounds for the specification of finite data types of means of equations and conditional equations (1993) (1)
Science Academy - the case for a new Welsh Academy (2006) (0)
The dynamics of belief: continuously monitoring and visualising complex systems (2022) (0)
The Netherlands rozenberg @ liacs . nl Physical Experiments as Oracles (2009) (0)
Mathematics for computing, by G. P. McKeown and V. J. Rayward-Smith. Pp 428. £18·00 hardcovers, £8·95 paper. 1982. ISBN 0-333-29169-7/29170 (Macmillan) (1983) (0)
People watching: Abstractions and orthodoxies of monitoring (2022) (0)
Inner structure of BPP / / log ? Counting calls to an oracle (2016) (0)
Hoare's logic and peano's arithmetic : (preprint) (1981) (0)
Partial arithmetical data types of rational numbers and their equational specification (2022) (0)
Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings (2006) (0)
The data type of spatial objects (2011) (0)
Abrahamson, KA, Downey, RG and Fellows, MR (1995) (0)
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters (1998) (0)
Computing roots of unity in fields : (preprint) (1979) (0)
Hierarchical Reconstructions of Cardiac (1998) (0)
Formal methods and verification (1990) (0)
Distributor:DepartmentofMathematics,Box480,S-75106Uppsala,Sweden PrintedinSwedenbyReprocentralenHSC,Uppsala1997 ToJessicaAcknowledgements (2011) (0)
UvA-DARE ( Digital Academic Repository ) Division safe calculation in totalised fields (2008) (0)
Written evidence (DSC0023): Select Committee on digital skills, oral and written evidence (2014) (0)
Which Arithmetical Data Types Admit Fracterm Flattening? (2022) (0)
Computational Biology of cardiac arrhythmias: from basic science to application (2003) (0)
On the refinement of specifications and hoare's logic : (preprint) (1980) (0)
Theory and methodology of design (1990) (0)
Theorising Monitoring: Algebraic Models of Web Monitoring in Organisations (2016) (0)
A formal model for the hierarchical design of synchronous and systolic algorithms (1990) (0)
Deviance in cybercommunities: the case of Second Life (2013) (0)
L O ] 1 2 O ct 2 01 8 An algebraic theory for data linkage ⋆ (2018) (0)
On the Role of Identity in Surveillance (2014) (0)
Division Safe Calculation in Totalised Fields 1 (2006) (0)
Mr2729665 (2012b: 68075) 68q05 (2010) (0)
Analogue-digital systems with modes of operation (2014) (0)
Newtonian mechanics and infinitely parallel computation 1 (0)
Theoretical Foundations of VLSI Design: Preface (1990) (0)
Infinitary initial algebra specifications for stream algebras (2016) (0)
Basic Programming: An Instructional Manual (1982) (0)
The Characterization Problem for Hoare Logics [ and Discussion ] (2007) (0)
Eager Equality for Rational Number Arithmetic (2023) (0)
On the Operational Structure of Algebraic Programming Systems (1980) (0)
Scientific PASCAL , by Harley Flanders. Pp 563. £27. 1984. ISBN 0-8359-6931-2 (Reston) (1985) (0)
The field of algebraic numbers fails to possess even a nice sound, if relatively incomplete, hoare-like logic for its while-programs : (preprint) (1980) (0)
Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational Theory (2022) (0)
Analogue-digital systems and the modular decomposition of physical behaviour (2018) (0)
Editor's Note (2014) (0)
Theoretical Foundations of VLSI Design: Methods of circuits and complexity theory (1990) (0)
Computability and Algebraic Specifications (2008) (0)
Intelligence and the Monitoring of Everyday Life (2018) (0)
Modern algebra : a natural approach, with applications (1982) (0)
An algebraic theory for data linkage (2018) (0)
Analogue-digital systems with modes of physical behaviour (2014) (0)
12345 efghi UNIVERSITY OF WALES SWANSEA REPORT SERIES The Rational Numbers as an Abstract Data Type by (2005) (0)

This paper list is powered by the following services:

Other Resources About John V. Tucker

en.wikipedia.org

What Schools Are Affiliated With John V. Tucker?

John V. Tucker is affiliated with the following schools: