<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Theory on Bulrush Labs — Richard Tibbetts</title><link>https://bulrushlabs.com/articles/tag/theory/</link><description>Recent content in Theory on Bulrush Labs — Richard Tibbetts</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sun, 02 May 2010 21:30:00 +0000</lastBuildDate><atom:link href="https://bulrushlabs.com/articles/tag/theory/index.xml" rel="self" type="application/rss+xml"/><item><title>End of the World Insurance: the Financial Halting Problem</title><link>https://bulrushlabs.com/articles/2010/05/02/end-of-the-world-insurance-the-financial-halting-problem/</link><pubDate>Sun, 02 May 2010 21:30:00 +0000</pubDate><guid>https://bulrushlabs.com/articles/2010/05/02/end-of-the-world-insurance-the-financial-halting-problem/</guid><description>&lt;p&gt;In computer science, the &lt;a href="https://en.wikipedia.org/wiki/Halting_problem"&gt;halting problem&lt;/a&gt; is very well known. The problem states that it is impossible to build a software program that can analyze other software programs to determine if they will eventually terminate, or halt. This is a useful problem to understand, because many software problems that look possible at first can be reduced to the halting problem and thus demonstrated to be impossible. It’s common to hear someone say “actually, that seems like a halting problem” when discussing compiler optimization, program analysis, and related problems in computer science. This is much like a physicist might say “but that’s perpetual motion.”&lt;/p&gt;</description></item></channel></rss>