THE TURING CENTENARY RESEARCH PROJECT: MIND, MECHANISM
AND MATHEMATICS
2nd Workshop, New York City, May 1214, 2014
Official website and registration:
http://turing.colorwork.com

MONDAY SCHEDULE:
VENUE:
Davis Auditorium,
Schapiro
Center for
Engineering and Physical Science Research (Schapiro CEPSR),
Morningside
Campus,
Columbia University.

9:00am 
WELCOME by George Deodatis, Chair, Civil Engineering and Engineering
Mechanics, Columbia University

9:05am 
OPENING  S Barry Cooper, Turing Centenary Research Project

9:10am 
Stephanie Dick (Harvard University) 
(Re)configuring Minds, Proof, and Computing in the Postwar United States

9:40am 
Paul Grant (University of Cambridge) 
Synthetic Spatial Patterning Using TwoChannel QuorumSensing Signaling

10:10am 
BREAK 
10:40am 
ERIC ALLENDER (Rutgers) 
The Saga of NPIntermediate Problems: A New Development in an Old Story 
11:40am 
[Via Skype] STUART KAUFFMAN (University of Vermont) 
Beyond the Stalemate: MindBody Revisited 
see
Cochrane, Ryan. "Beyond the MindBody Stalemate: An Interview with Stuart
Kauffman", Social Epistemology Review and Reply Collective 3, no. 4
(2014): 710

12:40pm 
LUNCH 
2:10pm 
Rebecca Schulman (Johns Hopkins University) 
Software
for Matter: Programming the Morphogenesis, Replication and
Metamorphosis of Everyday Things

2:40pm 
MARTIN DAVIS (New York University and UC Berkeley) 
Gödel, Mechanism, and Consciousness 
3:40pm 
BREAK 
4:10pm 
Rutger Kuyper (Radboud University Nijmegen) 
Intuitionistic Logic and Computability

4:40pm 
KLAUS SUTNER (Carnegie Mellon University) 
Classification of Cellular Automata

5:40pm 
CLOSE 



TUESDAY SCHEDULE:
VENUE:
750 CEPSR,
Schapiro
Center for
Engineering and Physical Science Research (Schapiro CEPSR),
Morningside
Campus,
Columbia University.

10:00am 
David Gamez (University of Sussex) 
Computation, Information and the Correlates of Consciousness

10:30am 
Noam Greenberg (Victoria University of Wellington) 
Computability and Strong Randomness 
11:00am 
BREAK 
11:40am 
BENJAMIN KOO (Tsinghua University) 
CELL: A Cognitive Extreme Learning Lab 
12:10pm 
LUNCH 
2:00pm 
Mark Braverman (Princeton University) 
Protecting a Conversation Against Adversarial Interference

2:30pm 
RUSSELL MILLER
(Queens College, City University of New York) 
Generalizing Turing Machines: ω_{1}Computation

3:30pm 
BREAK 
4:00pm 
SUSAN L. EPSTEIN
(CUNY Graduate School/Hunter College) 
Beyond Two: Discovering Complex Relationships in Realworld Problems

5:00pm 
Andrew Marks (Caltech) 
Descriptive Graph Combinatorics and Computability

5:30pm 
Simon Martiel (University of NiceSophia Antipolis) 
Causal Dynamics of Discrete Space 
6:00pm 
CLOSE 
CONFERENCE DINNER
with invited talk by Stephen Wolfram on
"The History of Taking Computation Seriously".
7pm at the Faculty Club of the Columbia University Medical Center. The cost of the
conference dinner will be $80, which will be collected on arrival. Please register.


WEDNESDAY SCHEDULE:
VENUE:
Davis Auditorium,
Schapiro
Center for
Engineering and Physical Science Research (Schapiro CEPSR),
Morningside
Campus,
Columbia University.

9:00am 
RAY DOUGHERTY (New York University) 
Turing, Chomsky and Wolfram 
10:00am 
BREAK 
10:30am 
Rob Cartolano introduces
STEPHEN WOLFRAM
(Founder and CEO of
Wolfram Research) 
The Computational Universe in Theory and Practice

12:35pm 
SHORT BREAK 
12:45pm 
Ray Dougherty moderates QUESTION & ANSWERS 
1:35pm 
Workshop Valedictory from S Barry Cooper

1:45pm 
CLOSE 
The Project Team:
Team Leader

is Professor of Mathematics at the University of Leeds.
Author and editor of numerous books,
including Computability Theory,
New Computational Paradigms, Computability in Context,
and Alan Turing  His Work and Impact
(winner of the
top honour, the R.R. Hawkins Award, at the 38th annual PROSE Awards),
he is a leading advocate of multidisciplinary research at the
interface between incomputability and real world computability.
Chair of the Turing Centenary Advisory Committee, which
coordinated the international Turing Centenary celebrations,
he is President of the Association Computability in Europe, which is
responsible for the largest computabilitythemed international conference
series, and chairs the Editorial Board of its Springer book
series Theory and Applications of Computability. He was a
member of the Board of Advisors of the John Templeton Foundation, 201113.

Turing Research Fellows and
Scholars

Mark Braverman is an assistant professor of computer science at
Princeton University. His main interests lie in the theory of
computation and its applications in the natural and social sciences.
He received his PhD from the University of Toronto in 2008 under the
supervision of Stephen Cook. [Turing Fellow]

Stephanie Dick is a doctoral candidate in the Department of History of Science at
Harvard University, under the supervision of Prof. Peter Galison. Her
dissertation is a historical exploration of attempts to automate
mathematical reasoning and theorem proving after the advent of
digital computing. She aims to recover and reconstruct the interactions
between theory, practice, and technology in historical understandings
of mind, computing, and mathematics. [Turing Fellow]

David
Gamez (University of Sussex)
David Gamez holds PhDs in both philosophy and computer science. His
crossdisciplinary research uses philosophy and neural modelling to
explore how a science of the mind can be developed based on mathematical
theories. Between 2009 and 2012 he was at Imperial College London,
where he worked on braininspired neural networks and robotics and
investigated new algorithms for making predictions about consciousness.
He is currently a Research Fellow at the Sackler Centre for
Consciousness Science, University of Sussex. [Turing Fellow]

Paul Grant (University of Cambridge)
Paul Grant is a postdoctoral fellow in the Department of Plant Sciences at
the University of Cambridge. He currently works on synthetic
patternforming genetic circuits in microbes but his background is in
developmental biology, having written his doctoral dissertation at the
University of Washington on neuron migration in zebrafish. He is originally
from Northern New York and maybe plans to pursue an academic career
back in the States. [Turing Fellow]

Noam Greenberg (Victoria University of Wellington)
I am a mathematician, interested in mathematical logic and in
particular in computability and set theory. I am interested in how
diverse notions such as randomness or algebraic structure, or
generalisations to large domains, influence our understanding of the
notion of computation. I work at Victoria University of Wellington,
New Zealand; I received a Ph.D. from Cornell University and a B.Sc.
from the Hebrew University of Jerusalem. [Turing Fellow]

Rutger
Kuyper (Radboud University Nijmegen)
My name is Rutger Kuyper and I am a PhD candidate at the RadboudUniversity Nijmegen
in the Netherlands. I am currently researching probability logic, in which mathematical logic (the subfield of
mathematics in which logical reasoning is investigated) is combined
with probabilistic, inductive reasoning. [Turing Scholar]

I recently finished a Ph.D under the supervision of Theodore Slaman at
UC Berkeley. I am currently a postdoctoral fellow at Caltech. [Turing Scholar]

Simon Martiel (University of NiceSophia
Antipolis)
I am starting a PhD in the University of NiceSophia Antipolis in
France supervised by Bruno Martin and Pablo Arrighi. I am interested in the
links between abstract notions in Computational Model Theory such as
model complexity or intrinsic universality and Theoretical Physics, trying
to answer the question: How does nature compute itself? [Turing Scholar]

Rebecca Schulman is an assistant professor of chemical and biomolecular
engineering and computer science at Johns Hopkins University. Her group is working to
learn how to program molecules to assemble complex patterns and structures that can learn and
adapt. [Turing Fellow]

The Big Questions

Turing's
work and scientific legacy inhabits a world at the interface between
the physical universe and the abstractions of mathematics;
between the computational, the predictable, and the uncertainties
manifest in human creativity, and in the emergence of form from
randomness and chaotic environments; and a world at the
interface between science, reason, reductionism and the mysteries
of intuition, incomputability, and the failures of foundational thinking.
There are many deep and intractable questions arise in such a
context. We list below four main
scientific themes
around which the research project has been built:

 The Mathematics of Emergence:
The Mysteries of Morphogenesis
 Q1.
Does emergence exist as something new in nature,
and is it something which transcends classical models of computation?
(Develop a sufficiently fundamental model of emergence to
answer this question.)
 Q2.
To what extent do existing models of natural processes accommodate
emergent relations?
(Characterize the mathematical characteristics of such models,
and the extent of their representational and recursive capacities.)
One of the less familiar but most innovative of Turing's
contributions was his successful capturing of emergence of various
patterns in nature in mathematical equations. This key innovation
now forms the basis of an active and important research field
for biologists.
There are still general questions concerning both the computational
content of emergence, of the unifying features extractable from
different contexts, and the nature of good mathematical models
applicable in different environments. John Holland, in his popular
1998 book on Emergence: From Chaos to Order
sets out the extent of our ignorance of the precise mathematical
character of emergence:
"It is unlikely that a topic as complicated as emergence will submit
meekly to a concise definition, and I have no such definition to offer."
Issues of selforganization, emergence of form from chaotic or
turbulent environments, nonlocality in physics, and the
relevance of classical models of computability such as Turing
machines, cellular automata, neural nets, among others, are all
in need of further investigation. It is hoped that a more coherent
and mathematicallybased viewpoint will shed light on some of the
issues arising under the following three headings.
 Possibility of Building a Brain:
Intelligent Machines, Practice and Theory
 Q1.
Is there a successful mathematical model of intelligent thought?
(Develop more basic models, capable of pinning down the exact
relationship between the human brain and standard paradigms
from classical computability and computer science.)
 Q2.
Is intelligent thought essentially experimental and inexact?
Are mistakes an essential aspect of intelligence?
 Q3.
What is the extent of application of the notion of a 'virtual
machine'? Is human thinking essentially embodied, and the
Turing paradigm of a universal machine inapplicable in this context?
Turing's seminal role in artificial intelligence  for instance,
his formulation of the Turing
Test and his interest in connectionist models  has given rise to
many different and contrasting approaches to building intelligent
machines. There is a basic dichotomy between experimental, ad hoc
approaches and more logicbased theoretical ones. There is a
general agreement that we need to understand more about the
relationship between these, and to obtain a better theoretical
grasp of the practicalities, and of the underlying theoretical
obstacles. The extent of the challenges facing researchers is
summed up by Rodney Brooks, in Nature in 2001:
"neither AI nor Alife has produced artifacts that could be
confused with a living organism for more than an instant."
The question of embodiment of intelligent computation is a key one,
and is related to the problems surrounding the character of
mental causation. As the Brown University philosopher Jaegwon Kim
puts it, in relation to the brain, in his book Physicalism,
or Something Near Enough (2005):
"... the problem of mental causation is solvable only if
mentality is physically reducible; however, phenomenal consciousness
resists physical reduction, putting its causal efficacy in peril."
Turing himself refers to the role of mistakes in human intelligence
(a feature without a positive role in current machinehosted
computation):
"if a machine is expected to be infallible, it cannot also be
intelligent. There are several theorems which say almost exactly that"
(talk to the London Mathematical Society, February 20,
1947, quoted by Andrew Hodges in Alan Turing  the enigma,
p.361).
One will be looking for new thinking in this area, or more insightful
unifying of existing knowledge. This is an area in which it is easy
to produce speculation detached from clearly formulated models, and
there will be an emphasis on rigor, clarity and mathematical content.
 Nature of Information:
Complexity, Randomness, Hiddenness of Information
 Q1.
To what extent is complexity practically computable?
(Elucidate the distinctions and identities pertaining to the
numerous computational complexity classes.)
 Q2.
How much mathematical randomness occurs in nature?
(Characterize quantum 'randomness',
and answer questions in the mathematical theory relating to
information theory, cryptology and physics.)
This is an area more concerned with practical issues of computation,
and the extraction of information from less favorable contexts.
The focus is more on what is possible in the way of information
processing. Cryptology, where this topic has its origins, has
advanced hugely since the time of Turing and his Bletchley Park
contemporaries, and there is a rich and developing mathematical
theory. There are basic issues of complexity,
also going back to the time of Gödel
and Turing, where progress depends on solutions to fundamental
questions. Turing's
own interest in computational efficiency, and by implication
complexity of programs, goes back to his work with the
'Turing Bombe'
at Bletchley Park in the 1940s. In her article on
Computing over the Reals: Where Turing Meets Newton
(Notices of the AMS, 2004), Lenore Blum traces Turing's
early contribution to the study of complexity in the context of
numerical analysis in Roundingoff Errors in Matrix Processes
in The Quarterly Journal of Mechanics and Applied Mathematics,
vol. I, 1948, pp. 287308, where she quotes Turing:
"It is convenient to have a measure of the amount of work involved in a
computing process, even though it be a very crude one ...
We might, for instance, count the number of additions, subtractions,
multiplications, divisions, recordings of numbers, ... "
There are connections to the fastdeveloping body of work
concerned with randomness and hidden information, and to
questions of the extent to which randomness occurs in
nature, particularly at the quantum level.
 How should we compute?
New Models of Logic and Computation
 Q1.
Working at the interface between science and mathematics,
how do classical models from logic and computability theory
model realworld processes?
(Develop the mathematical theories of relative computability,
and solve longstanding open problems relevant to
higherorder features of the real universe.)
 Q2.
What are the inadequacies of classical models, and what are
the new computational models which capture more of the essentials
of natural and physical computation?
(Develop new computational models, and identify the extent of
their realworld application.)
This theme would concern the extraction of mathematical models
of computation from nature, and the investigation of their
theoretical properties, a key concern of Turing himself.
Even for those who adhere to classical models, there are still
questions relating to modeling and underlying theory.
Here is David Deutsch quoted in the New Scientist
in 2006:
"I am sure we will have [conscious computers], I expect they will
be purely classical, and I expect that it will be a long time
in the future. Significant advances in our philosophical
understanding of what consciousness is, will be needed."
So topics can range from classical Turing analyses of the incomputable,
to new computational paradigms in bioinformatics, to quantum or
relativistic models from physics. Contributions relating to a
wide spectrum of different computational models, both new and
established ones, would be welcome. However, both modeling and
theory should be motivated by the drive to say something new and
fundamental about the nature of computation in the real universe.
The real contexts within which the models originate can also be
very diverse, but a unifying viewpoint will be encouraged.
