Professor John Tucker

Professor

Computer Science

+44 (0) 1792 295649

j.v.tucker@swansea.ac.uk

Office - 332
Third Floor
Computational Foundry
Bay Campus

Available For Postgraduate Supervision

Research Links

https://orcid.org/0000-0003-4689-8760

ResearcherID

About

Professor Tucker is a computer scientist whose research addresses what can and cannot be computed by people and machines.

He also studies the historical development of data and computing and their influence on society. He founded the University’s History of Computing Collection and the new Swansea research group called Educational, Historical and Philosophical Foundations of Computing.

Professor Tucker is also an expert on the history and heritage of science and technology in Wales.

Since coming to Swansea in 1989, he has served as Head of Department of Computer Science (1994-2008), Head of School of Physical Sciences (2007-11), and Deputy Pro-Vice Chancellor (2011-19).

Areas Of Expertise

Theory of data and data types
Algebraic methods for modelling and specification
Computability theory
Physical foundations for computation
Identity, monitoring and surveillance
History of computing
History of science and technology in Wales

Career Highlights

Teaching Interests

Professor Tucker has lectured on theoretical computer science to all sorts of people at all sorts of levels.

He enjoys lecturing and project supervision that explores the

(i) historical development of computing, combining technical, commercial, political, and social drivers and influences;

and

(ii) history of science and technology in Wales.

Research Award Highlights Collaborations

Publications

Research Highlights

Bergstra, J. & Tucker, J. (2024). A Complete Finite Axiomatisation of the Equational Theory of Common Meadows. ACM Transactions on Computational Logic, 0
https://doi.org/10.1145/3689211, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa67357
Bergstra, J. & Tucker, J. (2024). Fracterm Calculus for Signed Common Meadows. Transmathematica, 2024
https://doi.org/10.36285/tm.97, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66862
Bergstra, J. & Tucker, J. (2024). Logical Models of Mathematical Texts: The Case of Conventions for Division by Zero. Journal of Logic, Language and Information, 0
https://doi.org/10.1007/s10849-024-09420-w, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66861
Beggs, E. & Tucker, J. (n.d.) The dynamics of belief: continuously monitoring and visualising complex systems. arXiv
https://doi.org/10.48550/arXiv.2208.05764, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65454
Bergstra, J. & Tucker, J. (2024). Synthetic Fracterm Calculus. JUCS - Journal of Universal Computer Science, 30(3), 289-307.
https://doi.org/10.3897/jucs.107082, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65233

All Research

Journal Articles

Bergstra, J. & Tucker, J. (2024). A Complete Finite Axiomatisation of the Equational Theory of Common Meadows. ACM Transactions on Computational Logic, 0
https://doi.org/10.1145/3689211, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa67357
Bergstra, J. & Tucker, J. (2024). Logical Models of Mathematical Texts: The Case of Conventions for Division by Zero. Journal of Logic, Language and Information, 0
https://doi.org/10.1007/s10849-024-09420-w, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66861
Bergstra, J. & Tucker, J. (2024). Fracterm Calculus for Signed Common Meadows. Transmathematica, 2024
https://doi.org/10.36285/tm.97, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66862
Bergstra, J. & Tucker, J. (2024). Eager Term Rewriting For The Fracterm Calculus Of Common Meadows. The Computer Journal, 67(5), 1866-1871.
https://doi.org/10.1093/comjnl/bxad106, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65232
Bergstra, J. & Tucker, J. (2024). Synthetic Fracterm Calculus. JUCS - Journal of Universal Computer Science, 30(3), 289-307.
https://doi.org/10.3897/jucs.107082, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65233
Bergstra, J. & Tucker, J. (2023). Naive Fracterm Calculus. Journal of Universal Computer Science, 29(9), 961-987.
https://doi.org/10.3897/jucs.87563, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa63956
https://doi.org/10.3897/jucs.87563
Bergstra, J. & Tucker, J. (2023). Eager Equality for Rational Number Arithmetic. ACM Transactions on Computational Logic, 24(3), 1-28.
https://doi.org/10.1145/3580365, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa63639
http://dx.doi.org/10.1145/3580365
Wang, V. & Tucker, J. (2023). People watching: Abstractions and orthodoxies of monitoring. Technology in Society, 72, 102178
https://doi.org/10.1016/j.techsoc.2022.102178, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa62021
Bergstra, J. & Tucker, J. (2022). Partial arithmetical data types of rational numbers and their equational specification. Journal of Logical and Algebraic Methods in Programming, 128, 100797
https://doi.org/10.1016/j.jlamp.2022.100797, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa60726
Bergstra, J. & Tucker, J. (2022). Which Arithmetical Data Types Admit Fracterm Flattening?. Scientific Annals of Computer Science, XXXII(1), 87-107.
https://doi.org/10.7561/sacs.2022.1.87, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa60614
Beggs, E. & Tucker, J. (2022). A model of systems with modes and mode transitions. Journal of Logical and Algebraic Methods in Programming, 127, 100774
https://doi.org/10.1016/j.jlamp.2022.100774, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa59740
Bergstra, J. & Tucker, J. (2022). On The Axioms Of Common Meadows: Fracterm Calculus, Flattening And Incompleteness. The Computer Journal, 66(7)
https://doi.org/10.1093/comjnl/bxac026, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa60587
Bergstra, J. & Tucker, J. (2022). Totalising Partial Algebras. Transmathematica, 2022, 1-22.
https://doi.org/10.36285/tm.57, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa61536
Wang, V. & Tucker, J. (2021). ‘I am not a number’: Conceptualising identity in digital surveillance. Technology in Society, 67, 101772
https://doi.org/10.1016/j.techsoc.2021.101772, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa58362
https://researchportal.port.ac.uk/en/publications/i-am-not-a-number-conceptualising-digital-identity-in-digital-sur
Bergstra, J. & Tucker, J. (2020). The Transrational Numbers as an Abstract Data Type. Transmathematica, 2020, 1-29.
https://doi.org/10.36285/tm.47, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa56723
Tucker, J., Beggs, E., Cortez, P., & Costa, F. (2018). Classifying the computational power of stochastic physical oracles. International Journal of Unconventional Computing, 14(1), 59-90.
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa43498
https://www.oldcitypublishing.com/journals/ijuc-home/ijuc-issue-contents/ijuc-volume-14-number-1-2018/ijuc-14-1-p-59-90/
Tucker, J. (2017). Richard Price and the History of Science. Transactions of the Honourable Society of Cymmrodorion, 23, 69-86.
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa40899
Wang, V. & Tucker, J. (2017). Surveillance and identity: conceptual framework and formal models. Journal of Cybersecurity, 3(3), 145-158.
https://doi.org/10.1093/cybsec/tyx010, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa37276
Wang, V. & Tucker, J. (2016). Phatic systems in digital society. Technology in Society, 46, 140-148.
https://doi.org/10.1016/j.techsoc.2016.06.002, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa29529
Beggs, E., COSTA, J., POÇAS, D., & Tucker, J. (2016). Computations with oracles that measure vanishing quantities. Mathematical Structures in Computer Science, 1-49.
https://doi.org/10.1017/S0960129516000219, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa28344
Beggs, E., COSTA, J., POÇAS, D., & Tucker, J. (2014). AN ANALOGUE-DIGITAL CHURCH-TURING THESIS. International Journal of Foundations of Computer Science, 25(04), 373-389.
https://doi.org/10.1142/S0129054114400012, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa28415
Tucker, J. & Zucker, J. (2014). Computability of Operators on Continuous and Discrete Time Streams. Computability, 3(1), 9-44.
https://doi.org/10.3233/COM-14024, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa21548
http://content.iospress.com/articles/computability/com024
Costa, F., Beggs, E., & Tucker, J. (2014). Three forms of physical measurement and their computability. The Review of Symbolic Logic, 7(4), 618-646.
https://doi.org/10.1017/S1755020314000240, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa21456
http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=9461557&fileId=S1755020314000240
Beggs, E., Costa, J., Tucker, J., & Tucker, J. (2012). Axiomatizing physical experiments as oracles to algorithms. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 370(1971), 3359-3384.
https://doi.org/10.1098/rsta.2011.0427, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa12755
Beggs, E., Costa, J., & Tucker, J. (2012). The impact of models of a physical oracle on computational power. Mathematical Structures in Computer Science, 22(05), 853-879.
https://doi.org/10.1017/S0960129511000557, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa12756
Wang, V., Tucker, J., & Rihll, T. (2011). On phatic technologies for creating and maintaining human relationships. Technology in Society
https://doi.org/10.1016/j.techsoc.2011.03.017, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7198
Johnson, K. & Tucker, J. (2011). The data type of spatial objects. Formal Aspects of Computing
https://doi.org/10.1007/s00165-011-0182-7, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7202
Blanck, J., Stoltenberg-Hansen, V., & Tucker, J. (2011). Stability of representations of effective partial algebras. Mathematical Logic Quarterly
https://doi.org/10.1002/malq.200910133, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7204
Tucker, J., Zucker, J., & Tucker, J. (2011). Continuity of operators on continuous and discrete time streams. Theoretical Computer Science
https://doi.org/10.1016/j.tcs.2011.04.012, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7207
Wang, V., Haines, K., & Tucker, J. (2011). Deviance and Control in Communities with Perfect Surveillance - The Case of Second Life. Surveillance and Society, 9(1/2), 31-46.
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7936
Beggs, E., COSTA, J., & Tucker, J. (2010). Limits to measurement in experiments governed by algorithms. Mathematical Structures in Computer Science, 20(06), 1019-1050.
https://doi.org/10.1017/S0960129510000356, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7189
Beggs, E., Costa, J., & Tucker, J. (2010). Physical Oracles: The Turing Machine and the Wheatstone Bridge. Studia Logica
https://doi.org/10.1007/s11225-010-9254-6, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7201
Beggs, E., Tucker, J., Beggs, E., & Tucker, J. (2009). Computations via Newtonian and relativistic kinematic systems. Applied Mathematics and Computation, 215(4), 1311-1322.
https://doi.org/10.1016/j.amc.2009.04.052, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7191
Thompson, B., Tucker, J., Zucker, J., & Tucker, J. (2009). Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms. Applied Mathematics and Computation, 215(4), 1386-1403.
https://doi.org/10.1016/j.amc.2009.04.058, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa147
http://www.sciencedirect.com/science/article/pii/S0096300309004184
Beggs, E., Tucker, J., & Tucker, J. (2009). Computations via Newtonian and relativistic kinematic systems. Applied Mathematics and Computation, 215(4), 1311-1322.
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa148
Beggs, E., Costa, J., Loff, B., Tucker, J., Beggs, E., & Tucker, J. (2009). Computational complexity with experiments as oracles. II. Upper bounds. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 465(2105), 1453-1465.
https://doi.org/10.1098/rspa.2008.0412, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa149
Beggs, E., Costa, J., Tucker, J., & Tucker, J. (2009). Physical experiments as oracles. Bulletin of the European Association for Theoretical Computer Science, 97, 137-151.
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa171
Bergstra, J., Hirshfeld, Y., Tucker, J., & Tucker, J. (2009). Meadows and the equational specification of division. Theoretical Computer Science, 410(12-13), 1261-1271.
https://doi.org/10.1016/j.tcs.2008.12.015, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7203
http://www.sciencedirect.com/science/article/pii/S0304397508008967
Beggs, E., Costa, J., & Tucker, J. (2009). Computational Models of Measurement and Hempel’s Axiomatization.
https://doi.org/10.1007/978-90-481-3529-5_9, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7209
Blanck, J., Stoltenberg-Hansen, V., & Tucker, J. (2008). Stability for Effective Algebras. Electronic Notes in Theoretical Computer Science, 221, 3
https://doi.org/10.1016/j.entcs.2008.12.002, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa48
Bergstra, J., Tucker, J., & Tucker, J. (2008). Division Safe Calculation in Totalised Fields. Theory of Computing Systems, 43(3-4), 410
https://doi.org/10.1007/s00224-007-9035-4, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa156
Beggs, E., Costa, J., Loff, B., & Tucker, J. (2008). On the Complexity of Measurement in Classical Physics.
https://doi.org/10.1007/978-3-540-79228-4_2, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7200
Beggs, E., Costa, J., Loff, B., & Tucker, J. (2008). Computational complexity with experiments as oracles. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 464(2098), 2777-2801.
https://doi.org/10.1098/rspa.2008.0085, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7205
Beggs, E., Costa, J., Loff, B., & Tucker, J. (2008). Oracles and Advice as Measurements.
https://doi.org/10.1007/978-3-540-85194-3_6, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7211
Tucker, J., Beggs, E., & Tucker, J. (2007). Experimental computation of real numbers by Newtonian machines. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 463(2082), 1541
https://doi.org/10.1098/rspa.2007.1835, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa1736
Bergstra, J., Tucker, J., & Tucker, J. (2007). The rational numbers as an abstract data type. Journal of the ACM, 54(2), 7
https://doi.org/10.1145/1219092.1219095, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa1737
Tucker, J., Zucker, J., & Tucker, J. (2004). Abstract versus concrete computation on metric partial algebras. ACM Transactions on Computational Logic, 5(4), 611
https://doi.org/10.1145/1024922.1024924, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa1735
Tucker, J., Zucker, J., & Tucker, J. (2002). Abstract computability and algebraic specification. ACM Transactions on Computational Logic, 3(2), 279
https://doi.org/10.1145/505372.505375, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa1734
Beggs, E. & Tucker, J. (n.d.) The dynamics of belief: continuously monitoring and visualising complex systems. arXiv
https://doi.org/10.48550/arXiv.2208.05764, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65454

Authored Books

Beggs, E., Costa, J., Loff, B., Tucker, J., & Tucker, J. (2008). Oracles and advice as measurements Springer.
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa87

Book Chapters

Bergstra, J. & Tucker, J. (2022). Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational Theory. In Nils Jansen, Mariëlle Stoelinga, and Petra van den Bos (Ed.), Lecture Notes in Computer Science (pp. 63-80). Springer Nature Switzerland
https://doi.org/10.1007/978-3-031-15629-8_4, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa61535
Tucker, J. (2022). Origins and Development of Formal Methods. Texts in Theoretical Computer Science. An EATCS Series (pp. 455-488). Springer International Publishing
https://doi.org/10.1007/978-3-030-38800-3_9, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa61560
http://dx.doi.org/10.1007/978-3-030-38800-3_9
Beggs, E., Cortez, P., Costa, F., & Tucker, J. (2017). A hierarchy for BPP//log* based on counting calls to an oracle. Emergent Computation (pp. 39-56). Springer
https://doi.org/10.1007/978-3-319-46376-6_3, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa30854
http://www.springer.com/us/book/9783319463759
Johnson, K., Tucker, J., & Wang, V. (2017). Theorising Monitoring: Algebraic Models of Web Monitoring in Organisations. Recent Trends in Algebraic Development Techniques (pp. 13-35). Springer International Publishing
https://doi.org/10.1007/978-3-319-72044-9_3, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa33711
Ambaram, T., Beggs, E., Costa, J., Poças, D., & Tucker, J. (2016). An Analogue-Digital Model of Computation: Turing Machines with Physical Oracles. Emergence, Complexity and Computation (pp. 73-115). Springer International Publishing
https://doi.org/10.1007/978-3-319-33924-5_4, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa28340
Tucker, J., Zucker, J., & Tucker, J. (2016). Generalizing Computability Theory to Abstract Algebras. Turing’s Revolution (pp. 127-160). Bikhauser/Springer
https://doi.org/10.1007/978-3-319-22156-4_5, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa30876
http://link.springer.com/chapter/10.1007/978-3-319-22156-4_5
Edwin, B., Felix, C., & Tucker, J. (2012). Unifying science through computation: Reflections on computability and physics.
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7938
Tucker, J. (2011). Robert Recorde and the History of Computing.
https://doi.org/10.1007/978-0-85729-862-1, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7937

Conference Contributions

Bergstra, J. & Tucker, J. (2021). The Wheel of Rational Numbers as an Abstract Data Type. In M. Roggenbach (Ed.), Recent Trends in Algebraic Development Techniques (pp. 13-30). Springer International Publishing.
https://doi.org/10.1007/978-3-030-73785-6_2, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa56722
Johnson, K. & Tucker, J. (2012). Algebraic specifications of computing as a service with applications to cost analysis. In Proceedings 5th IEEE/ACM International Conference on Utility and Cloud ComputingIEEE Computer Society.
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa12757
Beggs, E., Costa, J., Loff, B., Tucker, J., & Tucker, J. (2008). On the complexity of measurement in classical physics. In Lecture Notes in Computer Science (pp. 20-30). Springer.
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa85
Beggs, E., Tucker, J., & Tucker, J. (2008). Programming Experimental Procedures for Newtonian Kinematic Machines. In Lecture Notes in Computer Science (pp. 52-66). Springer-Verlag.
https://doi.org/10.1007/978-3-540-69407-6_6, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7206

Other Research Outputs

Cobley, R., Beggs, E., Crooks, E., Palmer, R., & Tucker, J. (2022). WORKSHOP REPORT: MASI Agenda Setting Workshop on Unconventional and Natural Computing
https://doi.org/10.23889/SURep.60483, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa60483

Supervision

From Pitches to Pixels: The Datafication of European Football (current)

PhD

Other supervisor: Dr Troy Astarte
Theorising monitoring: general models and access control (current)

MSc

Other supervisor: Dr Edwin Beggs

Taught Modules

CSB190MC Computing: History and Impact

Computers and software are everywhere. The computer revolution has not slowed since it began in the late 1940s. In today¿s digital world, where are we exactly, and how did we get here? Where might we be heading? This module will provide some historical knowledge and understanding of the origins and development of computing and data processing, and their impact on the world. The module is interdisciplinary, situating technical developments in historical contexts and reflecting on human dispositions. The module is supported by Swansea University¿s History of Computing Collection.
CSC309 Invention and Innovation in Computing

The course will introduce the student to the history of contemporary computing. Among themes to be explored are the role of invention and innovation, and their commercialisation; and the impact of computing developments on society. The course will offer the opportunity for the student to investigate computing innovations and their historical development, or to work practically on items in the University¿s History of Computing Collection.

Public Engagements

Professor Tucker is Head of Knowledge Economy and Engagement for Science at Swansea (2011-), and an advocate for science engagement as a strong component of the Universitry’s Civic Mission.

His own contributions are in revealing the hidden histories of computing, and of science and technology more generally, through research articles, public lectures, collecting for the University’s History of Computing Collection, and conferences.

History of Computing Collection: Home
http://hocc.swansea.ac.uk

History of Computing Collection: Videos:
https://www.youtube.com/channel/UCn00nU-ndo9tDMY4AezF_uQ

History of Computing Collection: Images:
https://www.flickr.com/photos/hocc_swansea

Professor John Tucker

Telephone number

Email address

Youtube Account

Flickr Account

Research Links

About

Areas Of Expertise

Career Highlights

Research Highlights

All Research

From Pitches to Pixels: The Datafication of European Football (current)

Theorising monitoring: general models and access control (current)

CSB190MC Computing: History and Impact

CSC309 Invention and Innovation in Computing