Jon Awbrey<p><a href="https://mathstodon.xyz/tags/ThemeOneProgram" class="mention hashtag" rel="tag">#<span>ThemeOneProgram</span></a> • <a href="https://mathstodon.xyz/tags/JetsAndSharks" class="mention hashtag" rel="tag">#<span>JetsAndSharks</span></a> 1.5<br />• <a href="https://inquiryintoinquiry.com/2022/08/25/theme-one-program-jets-and-sharks-1/" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">inquiryintoinquiry.com/2022/08</span><span class="invisible">/25/theme-one-program-jets-and-sharks-1/</span></a></p><p>Reference —</p><p><a href="https://mathstodon.xyz/tags/McClelland" class="mention hashtag" rel="tag">#<span>McClelland</span></a>, J.L. (2015), <br />Explorations in <a href="https://mathstodon.xyz/tags/ParallelDistributedProcessing" class="mention hashtag" rel="tag">#<span>ParallelDistributedProcessing</span></a> : <br />A Handbook of Models, Programs, and Exercises, 2nd ed. (draft),<br /><a href="https://mathstodon.xyz/tags/StanfordParallelDistributedProcessingLab" class="mention hashtag" rel="tag">#<span>StanfordParallelDistributedProcessingLab</span></a>.<br />• <a href="https://web.stanford.edu/group/pdplab/" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="">web.stanford.edu/group/pdplab/</span><span class="invisible"></span></a><br /><a href="https://mathstodon.xyz/tags/PDPHandbook" class="mention hashtag" rel="tag">#<span>PDPHandbook</span></a> Online —<br />• <a href="https://web.stanford.edu/group/pdplab/pdphandbook/" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">web.stanford.edu/group/pdplab/</span><span class="invisible">pdphandbook/</span></a><br />Section 2.3 —<br />• <a href="https://web.stanford.edu/group/pdplab/pdphandbook/handbookch3#x7-320002.3" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">web.stanford.edu/group/pdplab/</span><span class="invisible">pdphandbook/handbookch3#x7-320002.3</span></a><br />Figure 2.1 —<br />• <a href="https://web.stanford.edu/group/pdplab/pdphandbook/jetsandsharkstable.png" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">web.stanford.edu/group/pdplab/</span><span class="invisible">pdphandbook/jetsandsharkstable.png</span></a></p><p><a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="tag">#<span>Logic</span></a> <a href="https://mathstodon.xyz/tags/LogicalGraphs" class="mention hashtag" rel="tag">#<span>LogicalGraphs</span></a> <a href="https://mathstodon.xyz/tags/Peirce" class="mention hashtag" rel="tag">#<span>Peirce</span></a><br /><a href="https://mathstodon.xyz/tags/CactusSyntax" class="mention hashtag" rel="tag">#<span>CactusSyntax</span></a> <a href="https://mathstodon.xyz/tags/LogicalCacti" class="mention hashtag" rel="tag">#<span>LogicalCacti</span></a><br /><a href="https://mathstodon.xyz/tags/MinimalNegationOperators" class="mention hashtag" rel="tag">#<span>MinimalNegationOperators</span></a></p>