Whence Complexity? - Michael Nygard

an hour
Quantum Mechanics and General Relativity don't agree on much, but both claim that every physical process is perfectly reversible. The Second Law of Themodynamics says, "Not likely!" The Second Law may win in the long run, but today, at (nearly) every scale, we see structure instead of randomness; complexity instead of chaos. It seems as though the natural state of the universe is ordered to a preposterously unlikely degree. Michael intends to explain it all.

Related Talks

Zach Tellman - Always Be Composing

The Clojure ecosystem, we're told, is made up of small, composable libraries. In practice, though, it's all too common to find that two libraries simply will not cleanly compose. This typically will lead to another library that does the same thing, but in a subtly different way. Sometimes this is ...

Solving Problems with Automata - Mark Engelberg & Alex Engelberg

Many of us have hazy memories of finite state machines from computer science theory classes in college. But finite state machines (FSMs) have real, practical value, and it is useful to know how to build and apply them in Clojure. For example, FSMs have long been popular to model game ...

Functional programming - Bodil Stokke

Build Your Own Lisp for Great Justice Implementing a toy Lisp interpreter is practically a rite of passage for the budding computer scientist. This hallowed tradition is described in detail in "Lisp in Small Pieces," the seminal work on the making of Lisps, but everybody loves a tl;dr, so let's do ...

Debugging with the Scientific Method - Stuart Halloway

About the speaker: Stuart Halloway (@stuarthalloway) is a founder and President of Cognitect (formerly Relevance). He is a Clojure committer, and a developer of the Datomic database. Stuart has spoken at a variety of industry events, including Strange Loop, Clojure/conj, EuroClojure, ClojureWest, SpeakerConf, QCon, GOTO, OSCON, RailsConf, RubyConf, JavaOne, and ...

Genetic Programming in Clojure - Lee Spector

Genetic programming harnesses the mechanisms of natural evolution, including mutation, recombination, and natural selection, to automatically synthesize computer programs. It has been applied to a wide range of problems spanning several areas of science, engineering, and the arts, in many cases equaling or exceeding human performance. Genetic programming's roots are in ...

Andy Keep - Writing a Nanopass Compiler

41 minutes
Contemporary compilers are among the most complex of software systems, typically being required to handle sophisticated high-level source languages, generate efficient code for multiple hardware architectures and operating systems, and support source-level debuggers, profilers, and other program development tools. Nanopass frameworks are designed to help manage this complexity. A nanopass ...

Machine Learning Live - Mike Anderson

28 minutes
This presentation will introduce a new start-up focused on machine learning that is using Clojure. We will discuss the technology and architecture it has developed for real-time machine learning and pattern recognition, and how Clojure provides a unique set of advantages. There will be a live coding demonstration of interactively applying ...

Clojure Data Science - Edmund Jackson

33 minutes
Data science / big data exists at the overlap of traditional analytics and large scale computation. As such, neither the traditional tools of analytics (R, Mathematica, Matlab) nor mainstreams languages (Java, C++, C#) supply its requirements well as they cannot simultaneously provide the mathematical abstractions and real-word platform power that ...

Tim Ewald - Clojure: Programming with Hand Tools

an hour
For most of human history, furniture was built by hand using a small set of simple tools. This approach connects you in a profoundly direct way to the work, your effort to the result. This changed with the rise of machine tools, which made production more efficient but also altered ...

Jeanine Adkisson - Variants are Not Unions

38 minutes
Variants are Not Unions Some of the most confounding design problems occur when a value can be more than one type of thing. Variants, a.k.a. tagged unions, are an elegant solution to this problem that is not supported in an obvious way in Clojure and is not supported in most mainstream ...