Longo: Schroedinger and Turing on the Logic of Life

CUNY SEMINAR IN LOGIC AND GAMES
Schroedinger and Turing on the Logic of Life: from the “coding” to the “genesis” of forms
Giuseppe Longo (CNRS & Ecole Normale Supérieure, Paris)
Friday, September 27, 2013, 2:00 PM
Room 4421, CUNY GC
Abstract. Schroedinger’s and Turing’s analyses of life phenomena have a twofold aspects. They both follow, first, a “coding paradigm”, of embryogenesis or of human computations and deductions respectively, and then move towards a more “dynamicist” approach. Schroedinger, in the second part of his 1944 book, hints to biological organization as negentropy – a variant of Gibbs dynamical analysis of energy – that we revitalized as anti-entropy, see references. Turing, after stressing that “the nervous system is surely not a Discrete State machine” (1950), invents the mathematics for an action/reaction/diffusion process, a “continuous system” (1952), where chemical matter (a hardware with no software) organizes itself along morphogenesis. We will hint to the paths for thought opened by Turing’s dynamics as continuous deformations at the core of Turing’s pioneering paper of 1952, where symmetry breakings are a key component of the bio-chemical processes.

co-sponsored by the Computational Logic Seminar

Scott: Lambda Calculus Then and Now

Lambda Calculus: Then and Now
Dana Scott (CMU and Berkeley)
November 9th (Friday), 5PM, 716 Philosophy Hall, Columbia University

Abstract. A very fast development in the early 1930’s following Hilbert’s codification of Mathematical Logic led to the Incompleteness Theorems, Computable Functions, Undecidability Theorems, and the general formulation of Recursive Function Theory. The so called Lambda Calculus played a key role. The history of these developments will be traced, and the much later place of Lambda Calculus in Mathematics and Programming Language Theory will be outlined.

A map of the Columbia campus and directions to the payday lenders room can be found here.

Turing meeting at Boston University

Turing 100
Sunday, November 11 and Monday, November 12
Photonics Center, 9th floor Colloquium Room
8 St. Mary’s Street, Room 906

Sunday, 10:00am-12:00pm
I. Turing’s Philosophical and Logical Foundations

“On Formalism Freeness: A Meditation on Gödel’s 1946 Princeton Bicentennial Lecture”
Juliette Kennedy Mathematics and Statistics, University of Helsinki

“Turing, Church, Gödel, a personal perspective”
Michael Rabin Computer Science, Harvard University

“Turing and Wittgenstein”
Juliet Floyd Philosophy, Boston University

Sunday, 1:45pm-3:45pm
II. Turing and Mathematics: Computability and Definability

“Universality is Ubiquitous”
Martin Davis Courant Institute, NYU; Mathematics, UC Berkeley

“Collapsing Sentences”
Gerald Sacks Mathematics, Harvard University and MIT

“The Hierarchy of Definability: An Extended Thesis”
Theodore Slaman Mathematics, UC Berkeley

Sunday, 4:00pm-6:00pm
III. Turing and Cryptography

“Rational Proofs”
Silvio Micali Computer Science, MIT

“Turing and the Growth of Cryptography”
Ronald Rivest Computer Science, MIT

“Alan Turing and Voice Encryption”
Craig Bauer Mathematics, York College of Pennsylvania

Monday, 9:30am-12:15pm
IV. Turing and AI

Title TBA
Marvin Minsky Media Arts and Sciences, MIT

“Why Neanderthals Couldn’t Pass Turing’s Test and When Computers Will”
Patrick Henry Winston Computer Science, MIT

“What’s Wrong with the Moral Turing Test?”
Matthias Scheutz Computer Science, Tufts University

“Embodying Computation at Higher Types”
S. Barry Cooper Mathematics, University of Leeds

Monday, 2:00pm-4:00pm
V. The Church-Turing Thesis

“Normal Forms for Puzzles: an Enigmatic Variant of Turing’s Thesis”
Wilfrid Sieg Philosophy, Carnegie Mellon University

Title TBA
Stephen Wolfram Wolfram Research

“Is there a Church-Turing Thesis for Social Algorithms?”
Rohit Parikh Computer Science, Mathematics, Philosophy, CUNY

Monday, 4:15pm-6:30pm
VI. Turing, Physics, and Probability

“Algorithmic Randomness and Turing’s Work on Normality”
Rod Downey Mathematics, Victoria University of Wellington

“Spacetime Physics and Non-Turing Computers”
Mark Hogarth Philosophy, Cambridge University

“The Mysterious Thesis”
Leonid Levin Computer Science, Boston University

CFP: The Turing Centenary Conference

THE TURING CENTENARY CONFERENCE

Manchester, UK, June 22-25, 2012
http://www.turing100.manchester.ac.uk/

First announcement and call for submissions

Features:

(1) Ten Turing Award winners, a Templeton Award winner and
Garry Kasparov as invited speakers
(2) 20,000 pounds worth best paper award program, including
5,000 pounds best paper award
(3) Three panels and two public lectures
(4) Turing Fellowship award ceremony
(5) and many more …

For more details please check
http://www.turing100.manchester.ac.uk/.

SPEAKERS

Confirmed invited speakers:

– Fred Brooks (University of North Carolina)
– Rodney Brooks (MIT)
– Vint Cerf (Google)
– Ed Clarke (Carnegie Mellon University)
– Jack Copeland (University of Canterbury, New Zealand)
– George Francis Rayner Ellis (University of Cape Town)
– David Ferrucci (IBM)
– Tony Hoare (Microsoft Research)
– Garry Kasparov (Kasparov Chess Foundation)
– Don Knuth (Stanford University)
– Yuri Matiyasevich (Institute of Mathematics, St. Petersburg)
– Roger Penrose (Oxford)
– Adi Shamir (Weizmann Institute of Science)
– Michael Rabin (Harvard)
– Leslie Valiant (Harvard)
– Manuela M. Veloso (Carnegie Mellon University)
– Andrew Yao (Tsinghua University)

Confirmed panel speakers:

– Ron Brachman (Yahoo Labs)
– Steve Furber (The University of Manchester)
– Carole Goble (The University of Manchester)
– Pat Hayes (Institute for Human and Machine Cognition, Pensacola)
– Bertrand Meyer (Swiss Federal Institute of Technology)
– Moshe Vardi (Rice University)

SUBMISSIONS:

Submissions are welcome in all areas related to the work of
Alan Turing in computer science, mathematics, cognitive science
and mathematical biology. A non-exclusive list of topics is
shown below:

– computation theory
– logic in computation
– artificial intelligence
– social aspects of computation
– models of computation
– program analysis
– mathematics of evolution and emergence
– knowledge processing
– natural language processing
– cryptography
– machine learning

See http://www.turing100.manchester.ac.uk/index.php/submission
for more details.

BEST PAPER AWARDS:

A subset of poster session submissions will be selected as
candidates for best paper awards:

– The best paper award of 5,000 pounds
– The best young researcher best paper award of 3,000 pounds
– The second best paper award of 2,500 pounds
– The second best young researcher best paper award of 1,500 pounds
– Sixteen (16) awards of 500 pounds each

See http://www.turing100.manchester.ac.uk/index.php/submission/bestpaper
for more details.

REGISTRATION:

The number of participants is limited. Register early to avoid
disappointment!

DATES:

February 23:    Paper submission opens
March 1:        Registration opens
March 15:       Extended abstract submission deadline
March 29:       Poster session notification and selection of candidates for the best paper awards
April 20:       Full versions of papers selected for the best paper awards
May 1:          Final versions of poster session papers
May 21:          Best paper award decisions
May 28:  Final versions of papers selected for the best paper awards
June 22-25:     Conference

CHAIRS:

Honorary Chairs:
Rodney Brooks (MIT)
Roger Penrose (Oxford)
Conference Chairs:
Matthias Baaz (Vienna University of Technology)
Andrei Voronkov (The University of Manchester)
Turing Fellowships Chair:
Barry Cooper (University of Leeds)
Programme Chair
Andrei Voronkov (The University of Manchester)

Reposted from Prof. Rohit Parikh