forked from pron/pron.github.io
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathatom.xml
116 lines (82 loc) · 10.8 KB
/
atom.xml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
<title>Ron Pressler</title>
<link href="/atom.xml" rel="self"/>
<id></id>
<updated>2018-03-02T19:11:35+00:00</updated>
<author>
<name></name>
<uri></uri>
<email></email>
</author>
<entry>
<title>Finite of Sense and Infinite of Thought: A History of Computation, Logic and Algebra, Part III</title>
<link href="/posts/computation-logic-algebra-pt3"/>
<id>/posts/computation-logic-algebra-pt3</id>
<updated>2018-01-19T00:00:00+00:00</updated>
<content type="html"><div class="fullwidth"> <p><a href="/computation-logic-algebra">Table of Contents</a></p> <div class="epigraph"> <blockquote> <p>An almost metaphysical system of abstract signs, by which the motion of the hand performs the office of the mind.</p> <p class="ep-footer">— Dionysius Lardner, <em>Babbage’s Calculating Engine</em>, 1834</p> </blockquote> <blockquote> <p>Even when the connotation of a term has been accurately fixed,...</content>
</entry>
<entry>
<title>Finite of Sense and Infinite of Thought: A History of Computation, Logic and Algebra, Part II</title>
<link href="/posts/computation-logic-algebra-pt2"/>
<id>/posts/computation-logic-algebra-pt2</id>
<updated>2018-01-12T00:00:00+00:00</updated>
<content type="html"><p><a href="/computation-logic-algebra">Table of Contents</a></p> <div class="epigraph"> <blockquote> <p>Logic is the science that exhaustively presents and strictly proves nothing but the formal rules of all thinking.</p> <p class="ep-footer">— Immanuel Kant, <em>Critique of Pure Reason</em>, Preface to the 2nd edition, 1787</p> </blockquote> </div> <h2 id="ii-divine-machines">II. Divine Machines</h2> <h3 id="celestial-mathematics">Celestial Mathematics</h3> <p>As we...</content>
</entry>
<entry>
<title>Finite of Sense and Infinite of Thought: A History of Computation, Logic and Algebra, Part I</title>
<link href="/posts/computation-logic-algebra-pt1"/>
<id>/posts/computation-logic-algebra-pt1</id>
<updated>2018-01-05T00:00:00+00:00</updated>
<content type="html"><p><a href="/computation-logic-algebra">Table of Contents</a></p> <div class="fullwidth"> <div class="epigraph"> <blockquote> <p>God invented and gave us sight to the end that we might behold the courses of intelligence in the heaven, and apply them to the courses of our own intelligence which are akin to them, the unperturbed to the perturbed; and...</content>
</entry>
<entry>
<title>Curry On Talk: The Practice and Theory of TLA+</title>
<link href="/posts/tlaplus-curryon-talk"/>
<id>/posts/tlaplus-curryon-talk</id>
<updated>2017-06-20T00:00:00+01:00</updated>
<content type="html"><script type="math/tex; mode=display">\newcommand{\sc}[1]{\mathrm{\small{#1}}\;} \newcommand{\comment}[1]{\bbox[lightgrey,2pt]{\text{#1}}} \newcommand{\str}[1]{``\mathsf{#1}\!"} \newcommand{\nested}[1]{\!\!\rlap{\begin{aligned}\begin{alignat}{1}#1\end{alignat}\end{aligned}}} \newcommand{\set}[1]{\{#1\}} \newcommand{\seq}[1]{\langle #1 \rangle} \newcommand{\llbracket}{[\![} \newcommand{\rrbracket}{]\!]} \newcommand{\sem}[1]{\llbracket #1 \rrbracket} \newcommand{\H}{-\!\!\!} \newcommand{\UR}{\lower 4.3pt {\urcorner}\!\!} \newcommand{\UL}{\lower 4.3pt {\ulcorner}\!\!\!} \newcommand{\LR}{\raise 2.5pt {\lrcorner}} \newcommand{\LL}{\raise 2.5pt {\llcorner}\!\!\!} \newcommand{\defeq}{\triangleq} \newcommand{\E}{\exists\,} \newcommand{\A}{\forall\,} \newcommand{\EE}{\pmb{\pmb{\boldsymbol{\boldsymbol{\exists}}}}\,} \newcommand{\AA}{\pmb{\pmb{\boldsymbol{\boldsymbol{\forall}}}}\,} \newcommand{\implies}{\Rightarrow} \newcommand{\whileop}{\overset{+}{-}\!\!\triangleright\; } \let\savedBox=\Box \renewcommand{\Box}{\raise1mu{\small \square} } \renewcommand{\Diamond}{ {\Large \diamond} } \newcommand{\LET}{\sc{LET}} \newcommand{\IN}{\sc{IN}} \newcommand{\RECURSIVE}{\sc{RECURSIVE}} \newcommand{\LAMBDA}{\sc{LAMBDA}} \newcommand{\IF}{\sc{IF}} \newcommand{\THEN}{\sc{THEN}}...</content>
</entry>
<entry>
<title>TLA+ in Practice and Theory<br/>Part 4: Order in TLA+</title>
<link href="/posts/tlaplus_part4"/>
<id>/posts/tlaplus_part4</id>
<updated>2017-06-15T00:00:00+01:00</updated>
<content type="html"><script type="math/tex; mode=display">\newcommand{\sc}[1]{\mathrm{\small{#1}}\;} \newcommand{\comment}[1]{\bbox[lightgrey,2pt]{\text{#1}}} \newcommand{\str}[1]{``\mathsf{#1}\!"} \newcommand{\nested}[1]{\!\!\rlap{\begin{aligned}\begin{alignat}{1}#1\end{alignat}\end{aligned}}} \newcommand{\set}[1]{\{#1\}} \newcommand{\seq}[1]{\langle #1 \rangle} \newcommand{\llbracket}{[\![} \newcommand{\rrbracket}{]\!]} \newcommand{\sem}[1]{\llbracket #1 \rrbracket} \newcommand{\H}{-\!\!\!} \newcommand{\UR}{\lower 4.3pt {\urcorner}\!\!} \newcommand{\UL}{\lower 4.3pt {\ulcorner}\!\!\!} \newcommand{\LR}{\raise 2.5pt {\lrcorner}} \newcommand{\LL}{\raise 2.5pt {\llcorner}\!\!\!} \newcommand{\defeq}{\triangleq} \newcommand{\E}{\exists\,} \newcommand{\A}{\forall\,} \newcommand{\EE}{\pmb{\pmb{\boldsymbol{\boldsymbol{\exists}}}}\,} \newcommand{\AA}{\pmb{\pmb{\boldsymbol{\boldsymbol{\forall}}}}\,} \newcommand{\implies}{\Rightarrow} \newcommand{\whileop}{\overset{+}{-}\!\!\triangleright\; } \let\savedBox=\Box \renewcommand{\Box}{\raise1mu{\small \square} } \renewcommand{\Diamond}{ {\Large \diamond} } \newcommand{\LET}{\sc{LET}} \newcommand{\IN}{\sc{IN}} \newcommand{\RECURSIVE}{\sc{RECURSIVE}} \newcommand{\LAMBDA}{\sc{LAMBDA}} \newcommand{\IF}{\sc{IF}} \newcommand{\THEN}{\sc{THEN}}...</content>
</entry>
<entry>
<title>TLA+ in Practice and Theory<br/>Part 3: The (Temporal) Logic of Actions</title>
<link href="/posts/tlaplus_part3"/>
<id>/posts/tlaplus_part3</id>
<updated>2017-06-08T00:00:00+01:00</updated>
<content type="html"><script type="math/tex; mode=display">\newcommand{\sc}[1]{\mathrm{\small{#1}}\;} \newcommand{\comment}[1]{\bbox[lightgrey,2pt]{\text{#1}}} \newcommand{\str}[1]{``\mathsf{#1}\!"} \newcommand{\nested}[1]{\!\!\rlap{\begin{aligned}\begin{alignat}{1}#1\end{alignat}\end{aligned}}} \newcommand{\set}[1]{\{#1\}} \newcommand{\seq}[1]{\langle #1 \rangle} \newcommand{\llbracket}{[\![} \newcommand{\rrbracket}{]\!]} \newcommand{\sem}[1]{\llbracket #1 \rrbracket} \newcommand{\H}{-\!\!\!} \newcommand{\UR}{\lower 4.3pt {\urcorner}\!\!} \newcommand{\UL}{\lower 4.3pt {\ulcorner}\!\!\!} \newcommand{\LR}{\raise 2.5pt {\lrcorner}} \newcommand{\LL}{\raise 2.5pt {\llcorner}\!\!\!} \newcommand{\defeq}{\triangleq} \newcommand{\E}{\exists\,} \newcommand{\A}{\forall\,} \newcommand{\EE}{\pmb{\pmb{\boldsymbol{\boldsymbol{\exists}}}}\,} \newcommand{\AA}{\pmb{\pmb{\boldsymbol{\boldsymbol{\forall}}}}\,} \newcommand{\implies}{\Rightarrow} \newcommand{\whileop}{\stackrel{+} -\!\!\triangleright\; } \let\savedBox=\Box \renewcommand{\Box}{\raise1mu{\small \square} } \renewcommand{\Diamond}{ {\Large \diamond} } \newcommand{\LET}{\sc{LET}} \newcommand{\IN}{\sc{IN}} \newcommand{\RECURSIVE}{\sc{RECURSIVE}} \newcommand{\LAMBDA}{\sc{LAMBDA}} \newcommand{\IF}{\sc{IF}}...</content>
</entry>
<entry>
<title>TLA+ in Practice and Theory<br/>Part 2: The + in TLA+</title>
<link href="/posts/tlaplus_part2"/>
<id>/posts/tlaplus_part2</id>
<updated>2017-06-01T00:00:00+01:00</updated>
<content type="html"><script type="math/tex; mode=display">\newcommand{\sc}[1]{\mathrm{\small{#1}}\;} \newcommand{\comment}[1]{\bbox[lightgrey,2pt]{\text{#1}}} \newcommand{\str}[1]{``\mathsf{#1}\!"} \newcommand{\nested}[1]{\!\!\rlap{\begin{aligned}\begin{alignat}{1}#1\end{alignat}\end{aligned}}} \newcommand{\set}[1]{\{#1\}} \newcommand{\seq}[1]{\langle #1 \rangle} \newcommand{\llbracket}{[\![} \newcommand{\rrbracket}{]\!]} \newcommand{\sem}[1]{\llbracket #1 \rrbracket} \newcommand{\H}{-\!\!\!} \newcommand{\UR}{\lower 4.3pt {\urcorner}\!\!} \newcommand{\UL}{\lower 4.3pt {\ulcorner}\!\!\!} \newcommand{\LR}{\raise 2.5pt {\lrcorner}} \newcommand{\LL}{\raise 2.5pt {\llcorner}\!\!\!} \newcommand{\defeq}{\triangleq} \newcommand{\E}{\exists\,} \newcommand{\A}{\forall\,} \newcommand{\EE}{\pmb{\pmb{\boldsymbol{\boldsymbol{\exists}}}}\,} \newcommand{\AA}{\pmb{\pmb{\boldsymbol{\boldsymbol{\forall}}}}\,} \newcommand{\implies}{\Rightarrow} \newcommand{\whileop}{\stackrel{+} -\!\!\triangleright\; } \let\savedBox=\Box \renewcommand{\Box}{\raise1mu{\small \square} } \renewcommand{\Diamond}{ {\Large \diamond} } \newcommand{\LET}{\sc{LET}} \newcommand{\IN}{\sc{IN}} \newcommand{\RECURSIVE}{\sc{RECURSIVE}} \newcommand{\LAMBDA}{\sc{LAMBDA}} \newcommand{\IF}{\sc{IF}}...</content>
</entry>
<entry>
<title>TLA+ in Practice and Theory<br/>Part 1: The Principles of TLA+</title>
<link href="/posts/tlaplus_part1"/>
<id>/posts/tlaplus_part1</id>
<updated>2017-05-25T00:00:00+01:00</updated>
<content type="html"><p><em>This is the first installment in a four-part blog post series about TLA+. <a href="/posts/tlaplus_part2">Part 2</a>, <a href="/posts/tlaplus_part3">Part 3</a>, <a href="/posts/tlaplus_part4">Part 4</a>. A <a href="/posts/tlaplus-curryon-talk">video of a 40-minute talk</a> that covers parts of this series.</em></p> <p><em>If you find TLA+ and formal methods in general interesting, I invite you to visit...</content>
</entry>
<entry>
<title>The Best Programming Language</title>
<link href="/posts/the-best-programming-language"/>
<id>/posts/the-best-programming-language</id>
<updated>2017-02-04T00:00:00+00:00</updated>
<content type="html"><p>A certain tweet caught my eye this past week. I will not link to it because I don’t want to single out its author, who expresses an opinion which is rather common in some crowds, but it said: “Do the people behind the big mainstream languages not follow PLT at...</content>
</entry>
<entry>
<title>What We Talk About When We Talk About Computation</title>
<link href="/posts/what-we-talk-about-when-we-talk-about-computation"/>
<id>/posts/what-we-talk-about-when-we-talk-about-computation</id>
<updated>2016-08-30T00:00:00+01:00</updated>
<content type="html"><p><em>Abstract: Machine and language models of computation differ so greatly in the computational complexity properties of their representation that they form two distinct classes that cannot be directly compared in a meaningful way. While machine models are self-contained, the properties of the language models indicate that they require a computationally...</content>
</entry>
</feed>