• An Incremental Approach to Compiler Construction
• Gaussian Processes for Big Data
• A beginner's guide to forcing
• Polynomial Exact-3-SAT Solving Algorithm
• Winner-Take-All Autoencoders
• A Roadmap towards Machine Intelligence
• InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets
• Concrete Problems in AI Safety
• Learning without Forgetting
• PathNet: Evolution Channels Gradient Descent in Super Neural Networks
• Deep Voice: Real-time Neural Text-to-Speech
• Adversarial Patch
• Machine Learning: The High-Interest Credit Card of Technical Debt
• On proof and progress in mathematics
• On the dimensionality of spacetime
• Overcoming catastrophic forgetting in neural networks
• A Notion of a Computational Step for Partial Combinatory Algebras
• Bertlmann's Socks and the Nature of Reality
• Cache Efficient Functional Algorithms
• A Few Useful Things to Know About Machine Learning
• A Cohomological Viewpoint on Elementary School Arithmetic
• Calculating Correct Compilers
• Possible Existence of a Neutron
• Writing parsers like it is 2017
• An Analysis of Single-Layer Networks in Unsupervised Feature Learning
• Functional Pearl: the countdown problem
• What Every Programmer Should Know About Memory
• Systems Approaches to Tackling Configuration Errors: A Survey
• Functional Pearl: Data Type a la Carte
• Reverse Compilation Techniques
• Design Beyond Human Abilities
• Deterministic Nonperiodic Flow
• The Derivative of a Regular Type is its Type of One-Hole Contexts
• On the Electrodynamics of Moving Bodies
• A Mathematical Theory of Communication
• Sketch of a Programme
• Infinite sets that admit fast exhaustive search
• Using closures for code generation
• Quotients Homophones des Groupes Libres Homophonic Quotients of Free Groups
• The Language and Grammar of Mathematics
• Example-Based Photometric Stereo: Shape Reconstruction with General, Varying BRDFs
• A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks
• How Complex Systems Fail
• Linear-Time Suffix Array Implementation in Haskell
• Dropout: A Simple Way to Prevent Neural Networks from Overfitting
• Kademlia: A Peer-to-peer Information System Based on the XOR Metric
• Lazy Functional State Threads
• A Unifying Review of Linear Gaussian Models
• On the Meanings of the Logical Constants and the Justifications of the Logical Laws
• Freer Monads, More Extensible Effects
• More is Different
• NixOS: A Purely Functional Linux Distribution
• Let's Go to the Whiteboard: How and Why Software Developers Use Drawings
• DOPPIO: Breaking the Browser Language Barrier
• Naked objects
• The Purely Functional Software Deployment Model
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Parallel Functional Arrays
• Propositions as Types
• Some thoughts on security after ten years of qmail 1.0
• 0.1 Reading Mathematics
• Robots take over the world
• Scripting: Higher-Level Programming for the 21st Century
• The Genuine Sieve of Eratosthenes
• Functional Pearl: A Program to Solve Sudoku
• Supercompilation by Evaluation
• The C standard formalized in Coq
• Tor: The Second-Generation Onion Router
• Trees that Grow
• Is the brain a good model for machine intelligence?
• Robust Real-time Object Detection
• Virtual Machine Monitors: Current Technology and Future Trends
• On the Einstein Podolsky Rosen paradox
• How to make ad-hoc polymorphism less ad hoc
• Comprehending Monads
• What is life?
• Urbit: A Solid-State Interpreter