Jack Copeland

Prof. Jack Copeland

1. School of Humanities and Creative Arts, University of Canterbury, Christchurch 8140, New Zealand
+1

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 August 2021 in Synthese
Verified
Journal Article
Open access
PDF file
NFNir Fresco
Nir Fresco
Jack CopelandJack Copeland
Jack Copeland
MWMarty Wolf
Marty Wolf
Do the dynamics of a physical system determine what function the system computes? Except in special cases, the answer is no: it is oftenindeterminatewhat function a given physical system computes. Accordingly, care should be taken when the question ‘What does a particular neuronal system do?’ is answered by hypothesising that the system computes aparticularfunction. The phenomenon of the indeterminacy of computation has important implications for the development of computational explanations of biological systems. Additionally, the phenomenon lends some support to the idea that a single neuronal structure may perform multiple cognitive functions, each subserved by a different computation. We provide an overarching conceptual framework in order to further the philosophical debate on the nature of computational indeterminacy and computational explanation.

1 January 2015
Verified
Book Chapter
Open access
PDF file
Jack CopelandJack Copeland
Jack Copeland
GSGiovanni Sommaruga
Giovanni Sommaruga
This chapter sets out the early history of the stored-program concept. The several distinct ‘onion skins’ making up the concept emerged slowly over a ten-year period, giving rise to a number of different programming paradigms. A notation is developed for describing different aspects of the stored-program concept. Theoretical contributions by Turing, Zuse, Eckert, Mauchly, and von Neumann are analysed, followed by a comparative study of the first practical implementations of stored-programming, at the Aberdeen Ballistic Research Laboratory in the US and the University Manchester in the UK. Turing’s concept of universality is also examined, and an assessment is provided of claims that various historic computers—including Babbage’s Analytical Engine, Flowers’ Colossus and Zuse’s Z3—were universal. The chapter begins with a discussion of the work of the great German pioneer of computing, Konrad Zuse.

18 March 2011 in Minds and Machines
Verified
Journal Article
Closed access
PDF file
Jack CopelandJack Copeland
Jack Copeland
OSOron Shagrir
Oron Shagrir

31 December 2006
Verified
Book Chapter
Closed access
Jack CopelandJack Copeland
Jack Copeland

1 June 2006 in Synthese
Verified
Journal Article
Closed access
PDF file
Jack CopelandJack Copeland
Jack Copeland

1 August 2023 in IEEE Annals of the History of Computing
Verified
Journal Article
Open access
Jack CopelandJack Copeland
Jack Copeland
This article presents an overview of Turing's early contributions to machine intelligence, together with a summary of his influence on other early practitioners. Following his famous work on the Entscheidungsproblem in the 1930s, Turing staked out the field of machine intelligence during the 1940s. His wartime Bombe used what we now call heuristic search to do work requiring intelligence when done by humans. In key papers in 1948 and 1950 he discussed search, learning, robotics, chess, the theorem-proving approach to AI, the genetic algorithm concept, and artificial neural networks, as well as introducing the Turing test. He influenced the first generation of programmers in Britain, whose pioneering contributions to machine intelligence included work on board games, learning, language-processing, and reasoning—contributions made years before the term ‘Artificial Intelligence’ was coined at Dartmouth in 1956.