Logblog: Richard Zach's Logic Blog

University of Calgary

UofC Navigation

You are looking at the old blog archive. LogBlog has moved to richardzach.org.

If you'd like to receive updates on new posts, please subscribe there!

Submitted by Richard Zach on Mon, 01/21/2013 - 7:49pm

All six of last year's lectures we had at Calgary's Turing Year series are now available for you to watch on mathtube.org. Thanks again to PIMS for videotaping, editing, and hosting them! The full list:

Central to Alan Turing's posthumous reputation is his work with British codebreaking during the Second World War. This relationship is not well understood, largely because it stands on the intersection of two technical fields, mathematics and cryptology, the second of which also has been shrouded by secrecy. This lecture will assess this relationship from an historical cryptological perspective. It treats the mathematization and mechanization of cryptology between 1920-50 as international phenomena. It assesses Turing's role in one important phase of this process, British work at Bletchley Park in developing cryptanalytical machines for use against Enigma in 1940-41. It focuses on also his interest in and work with cryptographic machines between 1942-46, and concludes that work with them served as a seed bed for the development of his thinking about computers.

In 1952, Turing published his only paper spanning chemistry and biology: "The chemical basis of morphogenesis". In it, he proposed a hypothetical mechanism for the emergence of complex patterns in chemical reactions, called reaction-diffusion. He also predicted the use of computational models as a tool for understanding patterning. Sixty years later, reaction-diffusion is a key concept in the study of patterns and forms in nature. In particular, it provides a link between molecular genetics and developmental biology. The presentation will review the concept of reaction-diffusion, the tumultuous path towards its acceptance, and its current place in biology.

In the 1940s Alan Turing’s homosexuality was an open secret amongst his co-workers at Bletchley Park. In 1952 the secret became widely known when Turing was arrested on charges of “gross indecency” under the same 1885 law that had led to the imprisonment of Oscar Wilde over half a century earlier. Opting for chemical “treatment” of his “condition” rather than imprisonment, Turing was one of many well-known casualties of a heightened drive against homosexuality in a postwar Britain that drew the line between the normal and the deviant more sharply than ever before. In his talk, Chris Waters will discuss Turing’s sexual proclivities and their meanings in the context of his times, focusing in particular on his arrest and subsequent fate in the context of the sexual politics of the first half of the 1950s. In addition, he will discuss the shaping of Turing’s posthumous reputation, beginning with the attempts made by the Gay Liberation Front in the 1970s to render Turing the gay icon he has become today.

While Turing is best known for his abstract concept of a "Turing Machine," he did design (but not build) several other machines - particularly ones involved with code breaking and early computers. While Turing was a fine mathematician, he could not be trusted to actually try and construct the machines he designed - he would almost always break some delicate piece of equipment if he tried to do anything practical. The early code-breaking machines (known as "bombes" - the Polish word for bomb, because of their loud ticking noise) were not designed by Turing but he had a hand in several later machines known as "Robinsons" and eventually the Colossus machines. After the War he worked on an electronic computer design for the National Physical Laboratory - an innovative design unlike the other computing machines being considered at the time. He left the NPL before the machine was operational but made other contributions to early computers such as those being constructed at Manchester University. This talk will describe some of his ideas behind these machines.

Turing's interest in the possibility of machine intelligence is probably most familiar in the form of the 'Turing Test', a version of which has been instantiated since 1991 as the Loebner Prize in Artificial Intelligence. To this date the Loebner Gold Medal has not been won. But should any future winner of the prize count themselves as having created a computer that thinks? Turing's 1950 Mind paper 'Computing Machinery and Intelligence', gives a sustained defence of the claim that a machine able to pass the test, which Turing called the Imitation Game, would indeed qualify as thinking. This lecture will explain the Turing Test as well as Turing's more general views concerning the prospects for artificial intelligence and examine both the criticisms of the test and Turing's rebuttals.

Many scientific questions are considered solved to the best possible degree when we have a method for computing a solution. This is especially true in mathematics and those areas of science in which phenomena can be described mathematically: one only has to think of the methods of symbolic algebra in order to solve equations, or laws of physics which allow one to calculate unknown quantities from known measurements. The crowning achievement of mathematics would thus be a systematic way to compute the solution to any mathematical problem. The hope that this was possible was perhaps first articulated by the 18th century mathematician-philosopher G. W. Leibniz. Advances in the foundations of mathematics in the early 20th century made it possible in the 1920s to first formulate the question of whether there is such a systematic way to find a solution to every mathematical problem. This became known as the decision problem, and it was considered a major open problem in the 1920s and 1930s. Alan Turing solved it in his first, groundbreaking paper "On computable numbers" (1936). In order to show that there cannot be a systematic computational procedure that solves every mathematical question, Turing had to provide a convincing analysis of what a computational procedure is. His abstract, mathematical model of computability is that of a Turing Machine. He showed that no Turing machine, and hence no computational procedure at all, could solve the Entscheidungsproblem.

- New Posts: Please Update Links and Subscriptions
- The LogBlog is Moving!
- Academic Genealogy Graphed
- CfP: Hilbert’s Epsilon and Tau in Logic, Informatics and Linguistics
- In Memoriam: Grigori Mints
- Previously Unknown Turing Manuscript Going to Auction
- Carnap (and Goodman and Quine) and Linguistics (Guest post by Darin Flynn)
- Carnap on "Syntax" vs "Semantics"