513:
268:
There is a simple
Newtonian experiment to measure mass, based upon colliding particles, for which there are uncountably many masses m such that for every experimental procedure governing the equipment it is only possible to determine finitely many digits of m, even allowing arbitrary long run times
152:, which are sets of data equipped with operations and tests. Tucker's theoretical work tackles the problems of: how to define or specify properties of the operations and tests of data types; how to program and reason with them; and how to implement them.
97:
and editor of several international scientific journals and monograph series. At
Swansea, he has been Head of Computer Science (1994–2008), Head of Physical Sciences (2007–11) and Deputy Pro Vice Chancellor (2011–2019). He is Member of
184:
For the other problems, he and his co-workers have developed two independent disparate generalisations of classical computability/recursion theory, which are equivalent for many continuous data types.
289:. Second, they have a theory of monitoring people and objects that is used to analyse many surveillance contexts and processes; this has led to mathematical models of monitoring systems derived from
232:
Since 2003, Tucker has worked with Edwin Beggs and Felix Costa on a general theory analysing the interface between algorithms and physical equipment. The theory answers various questions concerning:
305:. He has lectured on the history of computation since 1994, with interests in computing before computers, and theories of data and computation. He is a founding member of the editorial board of the
281:
Since 2004, Tucker and
Victoria Wang have studied the nature and role of digital data in personal, social and organisational contexts, especially surveillance. First, they have created a theory of
243:
By transforming the idea of oracle in computability theory, they combine algorithmic models with precisely specified models of physical processes. For example, they ask the question:
224:
The general theories have been applied as formal methods in microprocessor verifications, data types, and tools for volume graphics and modelling excitable media including the heart.
30:. 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/
449:
Victoria Wang, Kevin Haines and J V Tucker, Deviance and
Control in Communities with Perfect Surveillance – The Case of Second Life, Surveillance and Society, 9 (2011) 31-46,
86:
249:
If a physical experiment were to be completely controlled by an algorithm, what effect would the algorithm have on the physical measurements made possible by the experiment?
593:
588:
173:
Their program comprehensively classified specification methods for data types. The results combined techniques of universal algebra and recursion theory, including
159:
and Tucker established the expressive power of different types of equations and other algebraic formulae on any discrete data type, guided by theorems of the form:
166:
On any discrete data type, functions are definable as the unique solutions of small finite systems of equations if, and only if, they are computable by algorithms.
523:
82:
in 1989. In addition to theoretical computer science, Tucker also lectures on the history of computing and on the history of science and technology and Wales.
613:
608:
58:
Born in
Cardiff, Wales, he was educated at Bridgend Boys' Grammar School, where he was taught mathematics, logic and computing. He read mathematics at
618:
456:
Victoria Wang and J V Tucker, ‘I am not a number’: Conceptualising identity in digital surveillance
Technology in Society, 67, November 2021, 101772,
578:
498:
124:
In the early 1990s, he began to lobby for a national academy for Wales. In 2008 a process to create such an academy began sponsored by the then
484:
J V Tucker, The
Computer Revolution and Us: Computer Science at Swansea University from the 1960s, Swansea University Centenary Essays,
598:
111:
71:
583:
603:
313:
He also lectures on the history of science and technology in Wales and is a founding member of the editorial board of the
385:
J A Bergstra and J V Tucker, The rational numbers as an abstract data type, Journal of the ACM, 54: 2 (2007), Article 7.
261:. They show that the mathematics of computation imposes fundamental limits on what can be measured in classical physics:
206:
All computable functions on the real numbers are the unique solutions to a single finite system of algebraic formulae.
103:
314:
178:
214:
129:
94:
518:
259:
they model a technician, performing an experimental procedure that governs an experiment, by a Turing machine
443:
Victoria Wang and J V Tucker, Phatic systems in digital society. Technology in
Society, 46 (2016), 140-148,
121:
Professor Tucker is married to Dr. T.E. Rihll, formerly a Reader in
Ancient History at Swansea University.
573:
543:
188:
485:
63:
59:
332:
Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
568:
528:
132:
and in July 2010 he was appointed as its inaugural
General Secretary, a post he held until May 2017.
23:
257:
Their central idea is that, just as Turing modelled the human computer in 1936 by a Turing machine,
192:
125:
75:
302:
290:
217:, focuses on implementing data types using approximations contained in the ordered structures of
79:
43:
282:
149:
99:
401:
269:
for the procedure. In particular, there are uncountably many masses that cannot be measured.
27:
553:
306:
286:
67:
512:
174:
145:
39:
236:
how algorithms can be boosted by special purpose physical devices acting as "oracles";
102:. Outside of Computer Science, Tucker has been a Trustee of the Welsh think-tank, the
562:
218:
35:
538:
444:
239:
how algorithms control physical experiments that are designed to make measurements.
156:
31:
386:
62:(BA in 1973), and studied mathematical logic and the foundations of computing at
457:
196:
107:
405:
548:
369:
Handbook of Logic in Computer Science, Volume V: Logic and Algebraic Methods
141:
47:
89:
in 1985 and served as its president from its inception until 1992. He is a
450:
285:
technologies and integrated it into the theory of modernity developed by
148:. In general, data types, both discrete and continuous, are modelled by
533:
486:
https://collections.swansea.ac.uk/s/swansea-2020/page/computer-science
503:
423:
Computational complexity with experiments as oracles II: Upper bounds
115:
90:
22:(born 4 February 1952) is a British computer scientist and expert on
365:
Computable functions and semicomputable sets on many sorted algebras
347:
Handbook of Logic in Computer Science, Volume IV: Semantic Modelling
187:
The first generalisation, created with Jeffrey Zucker, focuses on
507:
78:, before returning to Wales as Professor of Computer Science at
301:
In 2007 Tucker founded the History of Computing Collection at
434:
Limits to measurement in experiments governed by algorithms
479:
Transactions of the Honourable Society of the Cymmrodorion
465:
Recorde: data, computation and the Tudor knowledge economy
155:
In a series of theorems and examples, starting in 1979,
412:
Computational complexity with experiments as oracles
394:
Meadows and the equational specification of division
112:
South Wales Institute of Engineers Educational Trust
87:
British Colloquium for Theoretical Computer Science
376:Abstract computability and algebraic specification
195:and covers specifications and verification using
66:(MSc in 1974, PhD in 1977). He has held posts at
367:, in S Abramsky, D Gabbay and T Maibaum (eds.),
345:, in S Abramsky, D Gabbay and T Maibaum (eds.),
445:http://dx.doi.org/10.1016/j.techsoc.2016.06.002
140:Classical computability theory is based on the
128:. Professor Tucker is a Founding Fellow of the
387:https://dl.acm.org/doi/10.1145/1219092.1219095
458:https://doi.org/10.1016/j.techsoc.2021.101772
421:E J Beggs, J F Costa, B Loff and J V Tucker,
410:E J Beggs, J F Costa, B Loff and J V Tucker,
8:
392:J A Bergstra, Y Hirschfeld and J V Tucker,
371:, Oxford University Press (2000), pp317–523.
349:, Oxford University Press (1995), pp357–526.
471:, University of Wales Press, 2012, 165–187.
438:Mathematical Structures in Computer Science
511:
38:data; and on using the generalisations as
544:History of Computing Collection Main Page
476:Richard Price and the History of Science,
297:Work on history of science and technology
213:The second generalisation, created with
594:Fellows of the Learned Society of Wales
589:Fellows of the British Computer Society
451:https://doi.org/10.24908/ss.v9i1/2.4096
380:ACM Transactions on Computational Logic
432:E J Beggs, J F Costa and J V Tucker,
352:V Stoltenberg-Hansen and J V Tucker,
341:V Stoltenberg-Hansen and J V Tucker,
7:
136:Work on computability and data types
110:branch. He is also a Trustee of the
614:Alumni of the University of Bristol
609:Alumni of the University of Warwick
427:Proceedings Royal Society Series A
416:Proceedings Royal Society Series A
14:
467:, in G Roberts and F Smith (ed),
228:Work on computability and physics
199:. For example, they showed that:
619:People educated at Ysgol Brynteg
358:Handbook of Computability Theory
338:, Volume 42 (1995), pp1194–1230.
579:Academics of Swansea University
529:History of Computing Collection
481:, New Series 21 (2017), 69–86.
74:Amsterdam, and at Bristol and
1:
469:Robert Recorde: Life and Work
382:, Volume 5 (2004), pp611–668.
360:, Elsevier (1999), pp363–447.
330:J A Bergstra and J V Tucker,
46:and on the interface between
524:The Learned Society of Wales
398:Theoretical Computer Science
42:for system design; based on
374:J V Tucker and J I Zucker,
363:J V Tucker and J I Zucker,
354:Computable rings and fields
635:
519:Interview with John Tucker
104:Institute of Welsh Affairs
16:British computer scientist
599:Welsh computer scientists
539:University of Wales Press
534:History of Computing Book
406:10.1016/j.tcs.2008.12.015
400:, 410 (2009), 1261–1271.
315:University of Wales Press
215:Viggo Stoltenberg-Hansen
130:Learned Society of Wales
95:British Computer Society
50:and physical equipment.
584:Scientists from Cardiff
429:, 465 (2009) 1453–1465.
418:, 464 (2008) 2777–2801.
277:Work on digital society
440:, 20 (2010) 1019–1050.
356:, in E Griffor (ed.),
189:imperative programming
179:Matiyasevich's theorem
604:Formal methods people
311:History of Computing.
106:and the chair of the
64:University of Bristol
60:University of Warwick
554:HOCC Youtube Channel
549:Images from The HOCC
510:Bibliography Server
24:computability theory
463:J V Tucker, Robert
319:Scientists of Wales
193:abstract data types
126:University of Wales
85:Tucker founded the
44:abstract data types
343:Effective algebras
336:Journal of the ACM
303:Swansea University
291:abstract data type
150:universal algebras
80:Swansea University
76:Leeds Universities
20:John Vivian Tucker
100:Academia Europaea
626:
515:
28:recursion theory
26:, also known as
634:
633:
629:
628:
627:
625:
624:
623:
559:
558:
495:
327:
299:
287:Anthony Giddens
279:
230:
146:natural numbers
138:
68:Oslo University
56:
34:and continuous/
17:
12:
11:
5:
632:
630:
622:
621:
616:
611:
606:
601:
596:
591:
586:
581:
576:
571:
561:
560:
557:
556:
551:
546:
541:
536:
531:
526:
521:
516:
501:
494:
493:External links
491:
490:
489:
482:
472:
461:
454:
447:
441:
430:
419:
408:
390:
383:
372:
361:
350:
339:
326:
323:
298:
295:
278:
275:
274:
273:
272:
271:
255:
254:
253:
252:
241:
240:
237:
229:
226:
211:
210:
209:
208:
175:term rewriting
171:
170:
169:
168:
144:of strings or
137:
134:
55:
52:
40:formal methods
15:
13:
10:
9:
6:
4:
3:
2:
631:
620:
617:
615:
612:
610:
607:
605:
602:
600:
597:
595:
592:
590:
587:
585:
582:
580:
577:
575:
574:Living people
572:
570:
567:
566:
564:
555:
552:
550:
547:
545:
542:
540:
537:
535:
532:
530:
527:
525:
522:
520:
517:
514:
509:
505:
502:
500:
497:
496:
492:
487:
483:
480:
477:
473:
470:
466:
462:
459:
455:
452:
448:
446:
442:
439:
435:
431:
428:
424:
420:
417:
413:
409:
407:
403:
399:
395:
391:
388:
384:
381:
377:
373:
370:
366:
362:
359:
355:
351:
348:
344:
340:
337:
333:
329:
328:
324:
322:
320:
316:
312:
308:
304:
296:
294:
292:
288:
284:
276:
270:
266:
265:
264:
263:
262:
260:
251:
248:
247:
246:
245:
244:
238:
235:
234:
233:
227:
225:
222:
220:
219:domain theory
216:
207:
204:
203:
202:
201:
200:
198:
194:
190:
185:
182:
180:
176:
167:
164:
163:
162:
161:
160:
158:
153:
151:
147:
143:
135:
133:
131:
127:
122:
119:
117:
116:Gower Society
113:
109:
105:
101:
96:
92:
88:
83:
81:
77:
73:
69:
65:
61:
53:
51:
49:
45:
41:
37:
33:
29:
25:
21:
504:J. V. Tucker
478:
475:
474:J V Tucker,
468:
464:
437:
433:
426:
422:
415:
411:
397:
393:
379:
375:
368:
364:
357:
353:
346:
342:
335:
331:
318:
317:book series
310:
309:book series
300:
280:
267:
258:
256:
250:
242:
231:
223:
212:
205:
186:
183:
172:
165:
157:Jan Bergstra
154:
139:
123:
120:
84:
57:
19:
18:
569:1952 births
197:Hoare logic
108:Swansea Bay
563:Categories
325:References
142:data types
114:, and the
48:algorithms
499:Home page
54:Biography
307:Springer
293:theory.
36:analogue
93:of the
32:digital
283:phatic
91:Fellow
70:, the
191:with
508:DBLP
177:and
506:at
402:doi
334:,
72:CWI
565::
436:,
425:,
414:,
396:,
378:,
321:.
221:.
181:.
118:.
488:.
460:.
453:.
404::
389:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.