 |
Research Interests: theory of data and data types;
programming and specification methods; logical and
algebraic methods for modelling and specification; computability
theory
for topological data types; synchronous concurrent algorithms; computablility and physical systems. History of computing. Technical, social, and cultural aspects of technological development. History of science in Wales. Applications: microprocessors, spatially extended dynamical systems, volume graphics, whole heart modelling, algorithms and experiments and analogue systems. Teaching Interests: theory of data types and programming languages; algebraic methods for modelling systems; synchronous concurrent algorithms; history of computation. Tel.: (+44) 01792 295649 |
|
Research
Classified list of publications of J V Tucker
Book
B. Möller and J. V. Tucker (editors), Prospects
for hardware foundations, Springer Lecture Notes in Computer
Science, Vol 1546, Springer Verlag, 1998, pp. x+468.
K. Meinke and J. V. Tucker, Universal Algebra, Handbook of Logic
for Computer Science. Volume I: Mathematical Structures,
in S. Abramsky, D. Gabbay and T. Maibaum (eds.), Oxford University
Press, Oxford, 1992, 189-411
V. Stoltenberg-Hansen and J.V. Tucker,
Effective Algebra, Handbook of Logic for Computer Science.
Volume IV Semantic Modelling in S. Abramsky, D. Gabbay and
T. Maibaum (eds.), Oxford University Press, Oxford, 1994, 357-526
V. Stoltenberg-Hansen and J. V. Tucker, Computable rings and fields, in
E Griffor (ed.), Handbook of Computability Theory, Elsevier,
1999, 363-447.
J. V. Tucker and J. I. Zucker, Computable functions and semicomputable sets on many sorted algebras, in S. Abramsky, D. Gabbay and T Maibaum (eds.), Handbook of Logic for Computer Science. Volume V Logic and Algebraic Methods, 2000, Oxford University Press, 317-523.
V Stoltenberg-Hansen and J V Tucker, Computability on topological spaces via domain representations, in S B Cooper, B Lowe and A Sorbi (eds), New Computational Paradigms: Changing Conceptions of What is Computable, Springer-Verlag, 2008, pp.153-194.
A.V. Holden, M. Poole and J.V. Tucker, Reconstructing the heart, Chaos,
Solitons and Fractals, 5 (1995) 691-704
N.A. Harman and J.V. Tucker, Algebraic
models of microprocessors: architecture and organisation,
Acta Informatica,33 (1996) 421-456
J.A. Bergstra and J.V. Tucker, Equational specifications, complete term
rewriting systems, and computable and semicomputable algebras, Journal
of the Association for Computing Machinery,42 (1995) 1194-1230
N.A. Harman and J.V. Tucker, Algebraic
models of microprocessors: the verification of a simple computer, Mathematics
for dependable systems II, Proceedings of the Second IMA
Conference, Oxford University Press, 1997, 135-169
A.V. Holden, M.J. Poole and J.V. Tucker, An algorithmic model of the
mammalian heart: propagation,
vulnerability, re-entry and fibrillation, International Journal of
Bifurcation and Chaos, 6 (1996) 1623-1635
J. V. Tucker and J. I. Zucker, Computation by while programs on
topological partial algebras, Theoretical Computer Science, 219
(1999) 379-421
V. Stoltenberg-Hansen and J. V. Tucker, Concrete models of computation
for topological algebras, Theoretical Computer Science, 219
(1999) 347-378
J. Blanck, V. Stoltenberg-Hansen and J. V. Tucker, Streams, stream
transformers and domain representations, in B. Möller and J. V.
Tucker (editors), Prospects for hardware foundations, Springer
Lecture Notes in Computer Science, Vol 1546, 1998, 27-68
M. J. Poole, J. V. Tucker and A. V. Holden, Hierarchies of spatially
extended systems and synchronous concurrent algorithms, in B.
Möller and J. V. Tucker (editors), Prospects for
hardware foundations, Springer Lecture Notes in Computer Science
Vol 1546, 1998, 184-235
J. Blanck, V. Stoltenberg-Hansen and J. V. Tucker,Domain representations
of partial functions, with applications to spatial objects and
constructive volume geometry,Theoretical Computer Science, 284
(2002) 207-24.
J V Tucker and J I Zucker, Abstract
computability and algebraic specification, ACM Transactions on
Computational Logic 3 (2002), 279-333.
J V Tucker and J I Zucker, Infinitary initial algebraic
specifications for stream algebras, in W Sieg, R Somer, C Talcott
(editors), Reflections on the foundations of mathematics: Essays in
honour of Solomon Feferman, Lecture Notes in Logic, volume 15,
Association for Symbolic Logic, 2002, 234-253.
M Chen and J V Tucker, Constructive
volume
geometry, Computer Graphics Forum, 19 (2000) 281-293.
M J Poole, A V Holden and J V Tucker, Hierarchical reconstructions of
cardiac tissue, Chaos, Solitons and
Fractals, 13 (2002) 1581-1612.
J V Tucker and J I Zucker, Origins of
our theory of computation on abstract data types at the Mathematical
Centre,
Amsterdam, 1979-80, in F de Boer et al, Liber Amicorum: J W de
Bakker, CWI Amsterdam, 2002.
J V Tucker and J I Zucker, Abstract
versus concrete models of
computation on partial metric algebras, ACM Transactions on
Computational Logic, 5 (2004) 611-668.
Min Chen, R H Clayton, A V Holden and J V Tucker, Visualising
cardiac anatomy using constructive volume geometry, in I E
Magnin, J Montagnat, P Clarysse, J Nenonen, T Katila (eds) Functional
Imaging and Modeling of the Heart, Lecture Notes in
Computer Science, Volume 2674, Springer-Verlag, Heidelberg, 2003,
pp.30-38.
Min Chen, R H Clayton, A V Holden and J V Tucker,
Constructive volume geometry applied to visualisation of cardiac
anatomy and electrophysiology, International J of Bifurcation and
Chaos, 13 (2003) 3591-3604.
K Stephenson, D Rees and J V Tucker, The algebraic structure of
interfaces, Science of Computer Programming, 49
(2003), pp. 47-88
J V Tucker and J I Zucker, Computable total
functions on metric
algebras,
universal algebraic specifications and dynamical systems, Journal
of
Algebraic and Logic Programming, 62 (2005) 71-108.
V Stoltenberg-Hansen and J V Tucker, Computable and
continuous partial homomorphisms on metric partial algebras, Bulletin
of Symbolic Logic, Volume 9, Issue 3, September 2003, pages 299 -
334.
E J Beggs and J V Tucker, Computations
via experiments with kinematic systems, Technical Report 5-2004,
Department of Computer Science, University of Wales Swansea, March
2004.
E J Beggs and J V Tucker, Embedding
infinitely parallel computation in Newtonian kinematic systems, Applied Mathematics and
Computation, 178 (2006) 25-43.
J V Tucker and J I Zucker, A network model of analogue computation over metric algebras, in S B Cooper, B Lowe, L Torenvliet (eds), Computability in Europe 2005, Lecture Notes in Computer Science 3526, Springer Verlag, 2005, pages 515-529.
J.V. Tucker, J.I. Zucker, Computability of analog networks, Theoretical Computer Science 371 (2007), 115-146 [doi:10.1016/j.tcs.2006.10.018] Here.
J A Bergstra and J V Tucker, The
rational numbers as an abstract data type, Journal of the ACM, 54 (2) Article 7 (April 2007). Here.
E J Beggs and J V Tucker, Can Newtonian
systems, bounded in space, time, mass and energy compute all
functions?, Theoretical Computer Science, 371 (2007) 4-19. Here.
E J Beggs and J V Tucker, Experimental computation of real numbers by Newtonian machines, Proceedings Royal Society Series A, 463 (2007) 1541-1561. Here.
J A Bergstra and J V Tucker, Meadows, Technical Report CSR??-2007, Department of Computer Science, University of Wales Swansea, April 2007.E J Beggs, J F Costa, B Loff and J V Tucker, Computational complexity with experiments as oracles, Proceedings Royal Society Series A, 464 (2008) 2777-2801. Here.
E J Beggs and J V Tucker, Programming experimental procedures for Newtonian kinematic machines, in A Beckmann, C Dimitracopoulos and B Lowe (eds), Computability in Europe, Athens, 2008, Springer Lecture Notes in Computer Science, Volume 5028, Springer, 2008, 52-66.
E J Beggs, J F Costa and J V Tucker, Oracles and advice as measurements, in C S Calude et al (eds), Unconventional Computing 2008, Springer Lecture Notes in Computer Science, Volume 5204, Springer, 2008, 33-50.
E J Beggs, J F Costa, B Loff, and J V Tucker, The complexity of measurement in classical physics, in M Agrawal, D Du,
Z Duan, A Li (eds), Theory and Applications of Models of Computation, Springer Lecture Notes in Computer Science, Volume 4978, Springer, 2008, 20-30.
E J Beggs, J F Costa, B Loff and J V Tucker, Computational complexity with experiments as oracles II: Upper bounds, Proceedings Royal Society Series A, 465 (2009) 1453-1465.
E J Beggs and J V Tucker, Computations via Newtonian and relativistic kinematic systems, Applied Mathematics and Computation, 215 (2009) 1311-1322.
B C Thompson, J V Tucker and J I Zucker, Unifying computers and
dynamical systems using the theory of synchronous concurrent
algorithms, Applied Mathematics and Computation, 215 (2009) 1386-1403.
E J Beggs, J F Costa, and J V Tucker, Unifying science through
computation: Reflections on computability and physics, in Olga Pombo,
Shahid Rahman, John Symons, and Juan Manuel Torres (eds.), Unity of Science. Essays in Honour of Otto Neurath, Series: Logic, Epistemology, and the Unity of Science, Springer, to appear.
E J Beggs, J F Costa, and J V Tucker, Computational models of Hempel's axiomatization of measurement, in press.
E J Beggs, J F Costa, and J V Tucker, Physical Experiments as Oracles, Bulletin of the European Association for Theoretical Computer Science, Volume 97, 137-151, February 2009.
University Home
| Computer Science Home
| Contact J V Tucker
Last updated at 19.00 on 17 October 2009 by Professor J.V.Tucker
