## Chris Lomont's lines of code over time

Over decades I’ve written a lot of personal code. I made a bar chart race showing how many lines I’ve written in different languages over time.

Read more →(Also lomonster.com and clomont.com)

Over decades I’ve written a lot of personal code. I made a bar chart race showing how many lines I’ve written in different languages over time.

Read more →Here’s a brief summary of C# features by vesion.

Read more →This is a 60 minute talk in which I tried to cover 30 algorithms and data structures in a concise manner. It covers all sorts of areas: sorting, string searching and matching, backtracking, randomness, skip lists, hashing, bloom filters, graph algorithms, space partitioning, concurrent and immutable data structures, cache oblivious techniques, compression, boolean satisfiability, and control theory.

Read more →These slides are from a talk I gave on many aspects of computing, starting with classical computing (Hilbert’s 10th problem, Church and Turing, Godel, boolean functions, complexity theory, transistors, Moore’s law and demise), then going through physics (relativity, quantum mechanics, quantum field theory), and finally into quantum computing basics (qubits, superposition, entanglement, no cloning, basic gates) and quantum algorithms (Deutsch, Simon, Shor, Grover).

Then I cover advanced quantum topics, such as quantum machines,quantum complexity theory, the Quantum-Church-Turing-Deutsch principle, graph isomorphism, quantum error correction, and quantum security. A final speculative section covers even weirder computation ideas (closed timelike curves, string computing) and how computing seems intertwined with the nature of reality (It from Bit, Simulation Hypthesis, Free Will Theorem).

Read more →This talk is an intro to wireless communications, starting with the basic physics of EM waves and how they interact with materials, then how antennas work, then on to antenna properties and design. Next modulation schemes are discussed, showing how data is encoded and transmitted over noisy channels via modulation, spread spectrum, time and frequency division, and other methods. Noise in the form of doppler, intermodulation, and other causes is covered. Information theory (channel capacity, Shannon entropy, error correction) is covered. Finally specific protocols are analyzed under this framework: FM, NTSC, remotes, WiFi, Bluetooth, ZigBee, satellite radio, GPS, and cellular formats.

Read more →This talk covers cryptography best practices as of April, 2018. Background on each area is covered, with each section ending with a best practices slide. Sections are Symmetric Encryption, Asymmetric Encryption, Key Lengths, Hashing/HMAC, Password usage, Key Exchange, Random number generation, Digital Signatures,

Read more →This talk is an introduction to functional programming, with a focus on F#. The first section covers functional programming history, techniques, and benefits. The second part shows how this is used in F#, covering F# syntax and some special features like Type Providers, Units of Measure, and performance compared to C#.

The third section goes into mind-bending topics like immutable data structure implementation, currying, the y-combinator, contravariant and covariant functors, and category theory.

Read more →This talk covers CPU architecture from the early days (Intel 4004) through modern designs (2018, Intel i7 and i9), with a view towards how the Meltdown and Spectre exploits were discovered. It covers virtual memory, process separation, cache issues, RAM details, pipelining and stalls, branch prediction, Moore’s law versus physics, and finally how Meltdown and Spectre are the consequence of many of these design decisions.

In the end I show the code for Meltdown along with a demo.

Read more →Here's FRACTRAN, a weird fraction based programming language, written in FRACTRAN.

Read more →How does one generate uniform random numbers in [0,1] using IEEE 754 floating point formats? It's tricky.

Read more →Here's bit tricks for efficient divisibility testing.

Read more →This is a hard puzzle about using two NOT gates to build three.

Read more →Here's some notes on compression.

Read more →Here's an embedded compression format I designed to meet certain requirements. It's small, fast, and efficient.

Read more →A post to test site features such as tables, math, code…

Read more →