A quantum Turing machine (QTM), also a universal quantum computer, is an abstract machine used to model the effect of a quantum computer.
 It provides a very simple model which captures all of the power of quantum computation.
 Any quantum algorithm can be expressed formally as a particular quantum Turing machine.
 Such Turing machines were first proposed in a 1985 article written by Oxford University physicist David Deutsch suggesting quantum gates could function in a similar fashion to traditional digital computing binary logic gates.
In computational complexity, a field of computer science, random-access Turing machines are an extension of Turing machines used to speak about small complexity classes, especially for classes using logarithmic time, like DLOGTIME and the Logarithmic Hierarchy.
A Turing machine is a basic model of computation.
 Some Turing machines might be specific to doing particular calculations.
 For example, a Turing machine might take input which comprises two numbers and then produce output which is the product of their multiplication.
 Another Turing machine might take input which is a list of numbers and then give output which is those numbers sorted in order.
In mathematics and computer science, Zeno machines (abbreviated ZM, and also called accelerated Turing machine, ATM) are a hypothetical computational model related to Turing machines that allows a countably infinite number of algorithmic steps to be performed in finite time.
 These machines are ruled out in most models of computation.
The General Purpose Analog Computer (GPAC) is a mathematical model of analog computers first introduced in 1941 by Claude Shannon.
 This model consists of circuits where several basic units are interconnected in order to compute some function.
 The GPAC can be implemented in practice through the use of mechanical devices or analog electronics.
 Although analog computers have fallen almost into oblivion due to emergence of the digital computer, the GPAC has recently been studied as a way to provide evidence for the physical Church–Turing thesis.
 This is because the GPAC is also known to model a large class of dynamical systems defined with ordinary differential equations, which appear frequently in the context of physics.
 In particular it was shown in 2007 that (a deterministic variant of) the GPAC is equivalent, in computability terms, to Turing machines, thereby proving the physical Church–Turing thesis for the class of systems modelled by the GPAC.
A Madman Dreams of Turing Machines is a book by Janna Levin which contrasts fictionalized accounts of the lives and ideas of Kurt Gödel and Alan Turing (who never met).
 The book won several awards, including the prestigious PEN/Bingham Fellowship Prize for Writers and the MEA Mary Shelley Award for Outstanding Fictional Work.
 It was also a runner-up for the Hemingway Foundation/PEN Award.
A Turing machine is a hypothetical computing device, first conceived by Alan Turing in 1936.
 Turing machines manipulate symbols on a potentially infinite strip of tape according to a finite table of rules, and they provide the theoretical underpinnings for the notion of a computer algorithm.
Janna J. Levin (born 1967) is an American theoretical cosmologist.
 She earned a PhD in theoretical physics at the Massachusetts Institute of Technology in 1993, and a Bachelor of Science in astronomy and physics with a concentration in philosophy at Barnard College in 1988, where she graduated Phi Beta Kappa.
 Much of her work deals with looking for evidence to support the proposal that our universe might be finite in size due to its having a nontrivial topology.
 Other work includes black holes and chaos theory.
 Since January 2004, she has been a professor of astronomy and physics at Barnard College of Columbia University.
In computability theory, super-recursive algorithms are a generalization of ordinary algorithms that are more powerful, that is, compute more than Turing machines.
 The term was introduced by Mark Burgin, whose book "Super-recursive algorithms" develops their theory and presents several mathematical models.
 Turing machines and other mathematical models of conventional algorithms allow researchers to find properties of recursive algorithms and their computations.
 In a similar way, mathematical models of super-recursive algorithms, such as inductive Turing machines, allow researchers to find properties of super-recursive algorithms and their computations.
Description numbers are numbers that arise in the theory of Turing machines.
 They are very similar to Gödel numbers, and are also occasionally called "Gödel numbers" in the literature.
 Given some universal Turing machine, every Turing machine can, given its encoding on that machine, be assigned a number.
 This is the machine's description number.
 These numbers play a key role in Alan Turing's proof of the undecidability of the halting problem, and are very useful in reasoning about Turing machines as well.

Question: What school is the author of A Madman Dreams of Turing Machines a professor at?
Answer: Barnard College