<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Probability on Lomont.org</title>
		<link>https://www.lomont.org/tags/probability/</link>
		<description>Recent content in Probability on Lomont.org</description>
		<generator>Hugo</generator>
		<language>en-us</language>
		
		
		
		
			<lastBuildDate>Wed, 15 May 2019 12:56:57 -0400</lastBuildDate>
		
			<atom:link href="https://www.lomont.org/tags/probability/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>30 Algorithms in 60 Minutes</title>
				<link>https://www.lomont.org/talks/2019/thirty-algorithms/</link>
				<pubDate>Wed, 15 May 2019 12:56:57 -0400</pubDate>
				<guid>https://www.lomont.org/talks/2019/thirty-algorithms/</guid>
				<description>&lt;p&gt;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.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Computation: Theory, Methods, Limitations, and the Future</title>
				<link>https://www.lomont.org/talks/2019/quantum-computing/</link>
				<pubDate>Mon, 25 Feb 2019 12:58:12 -0400</pubDate>
				<guid>https://www.lomont.org/talks/2019/quantum-computing/</guid>
				<description>&lt;p&gt;These slides are from a talk I gave on many aspects of computing, starting with classical computing (Hilbert&amp;rsquo;s 10th problem, Church and Turing, Godel, boolean functions, complexity theory, transistors, Moore&amp;rsquo;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).&lt;/p&gt;&#xA;&lt;p&gt;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 Hypothesis, Free Will Theorem).&lt;/p&gt;</description>
			</item>
			<item>
				<title>Meltdown and Modern CPU Architecture</title>
				<link>https://www.lomont.org/talks/2018/meltdown/</link>
				<pubDate>Wed, 10 Jan 2018 12:56:17 -0400</pubDate>
				<guid>https://www.lomont.org/talks/2018/meltdown/</guid>
				<description>&lt;p&gt;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&amp;rsquo;s law versus physics, and finally how Meltdown and Spectre are the consequence of many of these design decisions.&lt;/p&gt;&#xA;&lt;p&gt;In the end I show the code for Meltdown along with a demo.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Overview of Cryptology</title>
				<link>https://www.lomont.org/talks/2017/overview-of-cryptology/</link>
				<pubDate>Mon, 19 Jun 2017 10:49:20 -0400</pubDate>
				<guid>https://www.lomont.org/talks/2017/overview-of-cryptology/</guid>
				<description>&lt;p&gt;Here are slides for a long (3-4 hour) talk covering many aspects of cryptology. Topics include simple ciphers, breaking codes, private and public key crypto, block modes, stream ciphers, key exchange, random number generation, modern crypto design, hashing, password security, breaking (differential, higher order, many more..), out of band attacks (timing, cache, power, hardware, &amp;hellip;), homorphic encryption, quantum protocols, and more&amp;hellip;.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Average segment length</title>
				<link>https://www.lomont.org/posts/2016/random-segment-length/</link>
				<pubDate>Tue, 23 Aug 2016 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2016/random-segment-length/</guid>
				<description>&lt;p&gt;What&amp;rsquo;s the average length of a segment chosen uniformly by area on a unit square?&lt;/p&gt;</description>
			</item>
			<item>
				<title>Pick a Number</title>
				<link>https://www.lomont.org/posts/2016/pick-a-number/</link>
				<pubDate>Tue, 23 Aug 2016 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2016/pick-a-number/</guid>
				<description>&lt;p&gt;Here&amp;rsquo;s a result that is completely non-intuitive.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
