Definitely does compute

Girl Geek Dinners - December 2015

Computation: study of algorithmic processes that describe the transformation of information

my secret plan

David Hilbert

"I do not see that the sex of the candidate is an argument against her admission as a Privatdozent. After all, the university senate is not a bathhouse."

We must know. We will know.

q

Can we devise a process to determine in a finite number of operations, whether a first order logic statement is valid?

Alan Turing

Turing Machine

Alonzo Church

λ Calculus

Church-Turing Thesis

Grace Hopper

The first compiler: A-0

FLOW-MATIC

John McCarthy

ALGOL , Lisp

AI, time-sharing

'50s

  • ALGOL
  • COBOL
  • FORTRAN
  • LISP

'60s

  • APL
  • BASIC
  • LOGO
  • Smalltalk

'70s

  • ML
  • Prolog
  • C

'80s

  • Erlang
  • SQL
  • Miranda
  • C++

'90s

  • Haskell
  • Delphi
  • Java
  • Python
  • Ruby
  • Visual Basic
  • Javascript

'00s

  • C#
  • Scala
  • F#
  • Clojure
  • D

'10s

  • Elixir
  • Idris
  • Elm
  • Rust

We must know. We Will know

Thanks :D

thanks

Events and User Groups

fk

  • Functional Kats
  • Other user groups about programming languages that have no cats with capes on their logos :D

Resources

Photo credits

  • Phone
  • "Alonzo Church" by Princeton University. Licensed under Fair use via Wikipedia