Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6261682> ?p ?o }
Showing triples 1 to 72 of
72
with 100 triples per page.
- Q6261682 description "Welsh computer scientist".
- Q6261682 description "Welsh computer scientist".
- Q6261682 subject Q5312304.
- Q6261682 subject Q6492523.
- Q6261682 subject Q6647473.
- Q6261682 subject Q8219010.
- Q6261682 subject Q8237352.
- Q6261682 subject Q8237404.
- Q6261682 subject Q8445870.
- Q6261682 subject Q8445891.
- Q6261682 subject Q8466127.
- Q6261682 subject Q8723583.
- Q6261682 subject Q8911602.
- Q6261682 abstract "John Vivian Tucker (born 1952) 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 generalizing the classical theory to deal with all forms of discrete/digital and continuous/analogue data; and on using the generalizations as formal methods for system design; and on the interface between algorithms and physical equipment.".
- Q6261682 birthDate "1952".
- Q6261682 birthYear "1952".
- Q6261682 wikiPageExternalLink hocc.swan.ac.uk.
- Q6261682 wikiPageExternalLink homepage.php?staff=J.V.Tucker.
- Q6261682 wikiPageWikiLink Q1049183.
- Q6261682 wikiPageWikiLink Q1054410.
- Q6261682 wikiPageWikiLink Q1079166.
- Q6261682 wikiPageWikiLink Q1375924.
- Q6261682 wikiPageWikiLink Q1404101.
- Q6261682 wikiPageWikiLink Q1420500.
- Q6261682 wikiPageWikiLink Q145.
- Q6261682 wikiPageWikiLink Q15462007.
- Q6261682 wikiPageWikiLink Q16251580.
- Q6261682 wikiPageWikiLink Q1636734.
- Q6261682 wikiPageWikiLink Q1668499.
- Q6261682 wikiPageWikiLink Q173285.
- Q6261682 wikiPageWikiLink Q174948.
- Q6261682 wikiPageWikiLink Q3235968.
- Q6261682 wikiPageWikiLink Q3309454.
- Q6261682 wikiPageWikiLink Q337234.
- Q6261682 wikiPageWikiLink Q371160.
- Q6261682 wikiPageWikiLink Q459506.
- Q6261682 wikiPageWikiLink Q4969658.
- Q6261682 wikiPageWikiLink Q5312304.
- Q6261682 wikiPageWikiLink Q6191281.
- Q6261682 wikiPageWikiLink Q6492523.
- Q6261682 wikiPageWikiLink Q6647473.
- Q6261682 wikiPageWikiLink Q7568773.
- Q6261682 wikiPageWikiLink Q818930.
- Q6261682 wikiPageWikiLink Q8219010.
- Q6261682 wikiPageWikiLink Q8237352.
- Q6261682 wikiPageWikiLink Q8237404.
- Q6261682 wikiPageWikiLink Q827335.
- Q6261682 wikiPageWikiLink Q8445870.
- Q6261682 wikiPageWikiLink Q8445891.
- Q6261682 wikiPageWikiLink Q8466127.
- Q6261682 wikiPageWikiLink Q865528.
- Q6261682 wikiPageWikiLink Q8723583.
- Q6261682 wikiPageWikiLink Q8911602.
- Q6261682 wikiPageWikiLink Q919096.
- Q6261682 dateOfBirth "1952".
- Q6261682 name "Tucker, John".
- Q6261682 shortDescription "Welsh computer scientist".
- Q6261682 type Person.
- Q6261682 type Agent.
- Q6261682 type Person.
- Q6261682 type Agent.
- Q6261682 type NaturalPerson.
- Q6261682 type Thing.
- Q6261682 type Q215627.
- Q6261682 type Q5.
- Q6261682 type Person.
- Q6261682 comment "John Vivian Tucker (born 1952) 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 generalizing the classical theory to deal with all forms of discrete/digital and continuous/analogue data; and on using the generalizations as formal methods for system design; and on the interface between algorithms and physical equipment.".
- Q6261682 label "John V. Tucker".
- Q6261682 givenName "John".
- Q6261682 name "John Tucker".
- Q6261682 name "Tucker, John".
- Q6261682 surname "Tucker".