<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Logic on Lomont.org</title>
		<link>https://www.lomont.org/tags/logic/</link>
		<description>Recent content in Logic on Lomont.org</description>
		<generator>Hugo</generator>
		<language>en-us</language>
		
		
		
		
			<lastBuildDate>Fri, 26 Jul 2024 07:50:18 -0400</lastBuildDate>
		
			<atom:link href="https://www.lomont.org/tags/logic/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>MinimalTicTacToe</title>
				<link>https://www.lomont.org/posts/2024/minimaltictactoe/</link>
				<pubDate>Fri, 26 Jul 2024 07:50:18 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2024/minimaltictactoe/</guid>
				<description>&lt;!--summary--&gt;&#xD;&#xA;&lt;p&gt;Derivation of a minimal size tree for playing perfect tic tac toe&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>Making Three NOT Gates from Two</title>
				<link>https://www.lomont.org/posts/2017/making-three-not-gates/</link>
				<pubDate>Sat, 17 Sep 2016 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2017/making-three-not-gates/</guid>
				<description>&lt;p&gt;This is a hard puzzle about using two NOT gates to build three.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
