Tag Archives: turing

Turing100 Lecture: Butler Lampson – Systems, Security, Verification and more – Nov 24

Events, Featured, , , , , ,

In 1992, Butler Lampson received the Turing award in for his contributions to the development of distributed, personal computing environments and the technology for their implementation: workstations, networks, operating systems, programming systems, displays, security and document publishing.

On Saturday, 24th November, Neeran Karnik, Senior Architect at BMC Software, will give a talk about Butler Lampson’s work. This talk is a part of the Turing Awards monthly lecture series that happens at Persistent’s Dewang Mehta Auditorium.

This will be followed by a session on [“Experience Sharing – Systems design and development Projects in India”]. The speakers include Dr. Basant Rajan, CEO of Coriolis Software (previously CTO of Symantec India), and Abhay Ghaisas, Product Development Architect BMC Software.

The event is free for everyone to attend. Register here

About the Turing Awards

The Turing awards, named after Alan Turing, given every year, are the highest achievement that a computer scientist can earn. And the contributions of each Turing award winner are then, arguably, the most important topics in computer science.

About Turing 100 @ Persistent Lecture Series

This year, the Turing 100 @ Persistent lecture series will celebrate the 100th anniversary of Alan Turing’s birth by having a monthly lecture series. Each lecture will be presented by an eminent personality from the computer science / technology community in India, and will cover the work done by one Turing award winner.

The lecture series will feature talks on Ted Codd (Relational Databases), Vint Cerf and Robert Kahn (Internet), Ken Thompson and Dennis Ritchie (Unix), Jim Gray, Barbara Liskov, and others. Full schedule is here

This is a lecture series that any one in the field of computer science must attend. These lectures will cover the fundamentals of computer science, and all of them are very relevant today.

Fees and Registration

This is a free event. Anyone can attend.

The event will be at Dewang Mehta Auditorium, Persistent Systems, SB Road, from 2pm to 5pm on Saturday 24th November. This event is free and open for anybody to attend. Register here

Turing100 Lecture: Robin Milner and Polymorphic Type Inference in Programming Langauges – Oct 6

Events, Featured, , , , , ,

Robin Milner received the Turing award in 1991 for three major contributions to computer science:

  • In the area of automated theorem proving – He developed LCF, the first theoretically sound yet practical tool for machine assisted proof construction
  • In the area of programming language design – He developed ML, the first language to use polymorphic type inference along with a type-safe execution handling mechanism, something that underlies some of the most interesting new programming languages that are being developed today, and
  • In the area of concurrency – He developed CCS, a general theory of concurrency.

On 6th October, Navin Kabra (yes, that’s me), will give a talk about Robin Milner’s work. This talk is a part of the Turing Awards lecture series that happens at Persistent’s Dewang Mehta Auditorium at 2pm on the first Saturday of every month this year.

This will be followed by a panel discussion on “Should every programmer learn functional programming”. The panelists include Dhananjay Nene, Chief Architect at Vayana Software, Prof. Raju Pandey, of University of California-Davis, Rustom Modi, who has been teaching functional programming at the University of Pune for over 15 years, and who is a founder if i-Magus which delivers training in functional programming and other related technologies, and Kedar Swadi, CTO at AlgoAnalytics, and others. For more details of the panel discussion see this article

The event is free for everyone to attend. Register here

Abstract of the Talk

In this talk, I will give a brief overview of Robin Milner’s career, following by a technical dive into his work. I will briefly cover his work on automated theorem proving and LCF, which served as the motivation for the development of ML, the programming language intended to be used for automated theorem proving. ML ended up having a huge impact on the design of modern programming languages and its influence can be seen in important modern languages like Microsoft’s F#, Haskell, and the JVM based Scala. The bulk of my talk will cover the design of ML, with a specific focus on the polymorphic type inference system used in ML. Type inference is an important aspect of a lot of modern programming languages, and can be found, for example, in Google’s Go Language, Perl6, Visual Basic 9.0 onwards, C# version 3.0 onwards.

About the Turing Awards

The Turing awards, named after Alan Turing, given every year, are the highest achievement that a computer scientist can earn. And the contributions of each Turing award winner are then, arguably, the most important topics in computer science.

About Turing 100 @ Persistent Lecture Series

This year, the Turing 100 @ Persistent lecture series will celebrate the 100th anniversary of Alan Turing’s birth by having a monthly lecture series. Each lecture will be presented by an eminent personality from the computer science / technology community in India, and will cover the work done by one Turing award winner.

The lecture series will feature talks on Ted Codd (Relational Databases), Vint Cerf and Robert Kahn (Internet), Ken Thompson and Dennis Ritchie (Unix), Jim Gray, Barbara Liskov, and others. Full schedule is here

This is a lecture series that any one in the field of computer science must attend. These lectures will cover the fundamentals of computer science, and all of them are very relevant today.

Fees and Registration

This is a free event. Anyone can attend.

The event will be at Dewang Mehta Auditorium, Persistent Systems, SB Road, from 2pm to 5pm on Saturday 6th October. This event is free and open for anybody to attend. Register here

Lecture on Turing Award Winner Ted Codd (Databases) by Sham Navathe – 4 Aug

External Visitors, Featured, , ,

Ted Codd was awarded the Turing Award in 1981 for “his fundamental and continuing contributions to the theory and practice of database management systems.” A simpler way to put it would be that Codd was given the award for inventing relational databases (RDBMS).

On 4th August, Prof. Sham Navathe, of Georgia Tech University, who is visiting Pune, will talk about Ted Codd’s work. This talk is a part of the Turing Awards lecture series that happens at Persistent’s Dewang Mehta Auditorium at 2pm on the first Saturday of every month this year.

About the Turing Awards

The Turing awards, named after Alan Turing, given every year, are the highest achievement that a computer scientist can earn. And the contributions of each Turing award winner are then, arguably, the most important topics in computer science.

About Turing 100 @ Persistent Lecture Series

This year, the Turing 100 @ Persistent lecture series will celebrate the 100th anniversary of Alan Turing’s birth by having a monthly lecture series. Each lecture will be presented by an eminent personality from the computer science / technology community in India, and will cover the work done by one Turing award winner.

The lecture series will feature talks on Ted Codd (Relational Databases), Vint Cerf and Robert Kahn (Internet), Ken Thompson and Dennis Ritchie (Unix), Jim Gray, Barbara Liskov, and others. Full schedule is here

This is a lecture series that any one in the field of computer science must attend. These lectures will cover the fundamentals of computer science, and all of them are very relevant today.

Fees and Registration

This is a free event. Anyone can attend.

The event will be at Dewang Mehta Auditorium, Persistent Systems, SB Road, at from 2pm to 5pm on Saturday 4th August. This event is free and open for anybody to attend. Register here

Event Report: Turing 100 @ Persistent – The Theory of Computation

Live Blogging, ,

This is a liveblog of the Turing 100 @ Persistent Event.

The Turing Awards celebrate the achievements of some of the most influential computer scientists. Unfortunately, a lot of the professionals and students in computer science are not well versed with the work of Turing Award winners, and since this year is the 100th birth anniversary of Alan Turing, the Turing 100 @ Persistent Lecture series has been started with the hope of sparking an interest amongst the computer science and software community in looking at computer science in some depth.

For each lecture, one Turing Award recipient will be picked and a 90-minute talk will be given on the work of that person. One such lecture will happen on every 1st Saturday of every month until June 2013. The schedule can be see here

Today’s event features a talk about Alan Turing himself by Mathai Joseph, Advisor TCS, followed by a talk on Turing’s Theory of Computation by Vivek Kulkarni, a Principal Architect at Persistent Systems.

Alan Turing – by Mathai Joseph

These are some rough notes taken during the talk.

  • Turing was the first person to provide a mathematical model for the concept of “computation” which could be used for mathematically proving things related to computation. This led to the concept of:
    • computability – whether something can be computed by computers
    • decidability – whether it is possible to
    • He did all of this before getting a PhD
  • Church – Turing Thesis
    • Turing went to Princeton to Work with Alonzo Church
    • Church had proved computability result using lambda calculus
    • Church, Kleene, and Rosser had used recursive functions
    • Turing showed that this could be shown much more simply using the Turing machine
  • Did his PhD from Princeton in 1938
    • Mathematical basis for computing
    • intuitively understandable solution
  • After his PhD, Turing went to Bletchley Park, which had the UK government’s main “decryption” center
    • Bletchley Park was involved in cryptanalysis – breaking of codes
    • Huge teams human analysts worked in shifts to break codes
    • Turing joined and became a leader in cryptanalysis
    • Bletchley Park relied on Turing to invent new, better methods for breaking codes
    • He played a key part in deciphering the Enigma code that the Germans used during World War 2.
  • After the war, Turing moved to Manchester to work on:
    • Computer Design
    • AI
    • Program Verification
    • Morphogenesis
  • One of Turing’s lasting legacies is the study of complexity of algorithms
    • There is a long history of interest in this area
    • Ancient Greeks did it. Mathematicians in Kerala did it.
    • Mathematicians did it too: Cantor, Hilbert, Pocklinton, Post, Church, Turing
    • Given a strong base in 1960s – Hartmanis and Stearns formally quantified time & space of a computation in terms of number of steps taken by a Turing machine to complete the computation, and the total number of cells used on the tape. Obviously, Turing machines were key to this analysis. Without it, characterising the problem would have been much more difficult.
  • Computer Science without Turing Machine?
    • Difficult to imagine
    • Something else would have evolved but:
      • Would have taken longer to find
      • Would have been harder to understand
      • Would have been of less practical use
  • Finally
    • Turing was 42 when he died (by cyanide poisoning – unclear whether it was a suicide or an accident)
    • We can only guess what he might have done if he had lived longer
    • A remarkable mind: mathematician, scientist, engineers and 100% genius

Turing’s Theory of Computation – by Vivek Kulkarni

This talk was an in-depth look at the theory of computation, covering:

  • The concept of a state machine
  • Determinism and non-determinism
  • The concept of a Turing Machine
  • Solvable and semi-solvable problems
  • Godel numbering and Turing machine encoding
  • The Universal Turing Machine
  • The Halting Problem
  • Multi-tape Turing Machines

Unfortunately, the talk was quite technical, and it is not easy to blog about it, especially without diagrams (which are quite important when you need to understand state machines and Turing machines, hence unfortunately, this live blog ends here.)

The next talk in this series will be on 4th August where Prof. Sham Navathe, from Georgia Tech University, USA, who is visiting Pune, will talk about the work of Ted Codd, the inventor of relational databases.