#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1979

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- B. Jack Copeland, Diane Proudfoot, +5 authors Ralph Blake
- 1998

Accelerated Turing machines are Turing machines that perform tasks commonly regarded as impossible, such as computing the halting function. The existence of these notional machines has obvious implications concerning the theoretical limits of computability. 2

- B. Jack Copeland
- Minds and Machines
- 2002

Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of π contains n consecutive 7s, for any n; solve the Turing-machine halting problem; and decide the predicate calculus. Are accelerating… (More)

- B. Jack Copeland
- Complexity
- 1998

- B. Jack Copeland
- 1997

A myth has arisen concerning Turing's paper of 1936, namely that Turing set forth a fundamental principle concerning the limits of what can be computed by machine-a myth that has passed into cognitive science and the philosophy of mind, to wide and pernicious effect. This supposed principle, sometimes incorrectly termed the 'Church-Turing thesis', is the… (More)

- B. Jack Copeland
- Machine Intelligence 15
- 1995

- B. Jack Copeland
- Theor. Comput. Sci.
- 2004

A survey of the ÿeld of hypercomputation, including discussion of four a priori objections to the possibility of hypercomputation. An exegesis of Turing's pre-and postwar writings on the mind is given, and Turing's views on the scope of machines are discussed. 1. What is hypercomputation? Hypercomputation is the computation of functions or numbers that… (More)

- B. Jack Copeland
- J. Philosophical Logic
- 1979

- B Jack Copeland, Ed, Sydney Dekker
- 2015

It's really good to see Alan Turing finally getting his due in the popular media. He's been a large figure in the mathematical foundations of modern computing from the 1930s (along with John von Neumann and Emil Post, to name just a couple) for quite a long time. Despite this, and despite the fact that Tur-ing's work is often glossed in elementary computing… (More)

It is not widely realised that Turing was probably the first person to consider building computing machines out of simple, neuron-like elements connected together into networks in a largely random manner. Turing called his networks 'unorganised machines'. By the application of what he described as 'appropriate interference, mimicking education' an… (More)

- B. Jack Copeland
- J. Philosophical Logic
- 2002