#### Filter Results:

#### Publication Year

1979

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

In mice administered chronic stress--repeated overnight restraint stress for 7 days--there was a prolonged enhancement of dopamine (DA) uptake into synaptosomes. The mRNA for the DA transporter (DAT) was found to be concomitantly increased in the midbrain, as was the binding of the transporter ligand mazindol to DAT in the nucleus accumbens and… (More)

- B. Jack Copeland, Diane Proudfoot, Peter Farleigh, Philip Catton, Chris Bullsmith, Neil Tennant +2 others
- 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

Incubation with either of the protein kinase C activators phorbol 12-myristate 13-acetate (PMA) and sn-1,2 dioctanoylglycerol (DiC8) decreased the uptake of dopamine into striatal synaptosomes, whereas the inactive phorbol ester 4 alpha-PMA had no effect. Washout of PMA and DiC8 failed to reverse the decrease in uptake. Kinetic analysis showed a decrease in… (More)

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
- 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)

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, 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)