<?xml version="1.0" encoding="UTF-8" ?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:base="http://everything2.com/">
    <title>irexe's New Writeups</title>
    <link rel="alternate" type="text/html" href="http://everything2.com/index.pl?node=Everything%20User%20Search&amp;usersearch=irexe" />
    <link rel="self" type="application/atom+xml" href="?node=New%20Writeups%20Atom%20Feed&amp;type=ticker&amp;foruser=irexe" />
    <id>http://everything2.com/?node=New%20Writeups%20Atom%20Feed&amp;foruser=irexe</id>
    <updated>2002-12-01T15:23:10Z</updated>
<entry><title>1 (idea)</title><link rel="alternate" type="text/html" href="http://everything2.com:80/user/irexe/writeups/1"/><id>http://everything2.com:80/user/irexe/writeups/1</id><author><name>irexe</name><uri>http://everything2.com:80/user/irexe</uri></author><published>2002-12-01T15:23:10Z</published><updated>2002-12-01T15:23:10Z</updated>
<content type="html">&lt;p&gt;
Also known as 0.999999........
&lt;/p&gt;

&lt;p&gt;It is a little known, yet very important fact that the &lt;a href=&quot;/title/Arab&quot;&gt;Arab&lt;/a&gt; &lt;a href=&quot;/title/numeral+system&quot;&gt;numeral system&lt;/a&gt;, which is universally used nowadays, is not &lt;a href=&quot;/title/unambiguous&quot;&gt;unambiguous&lt;/a&gt;. Any &lt;a href=&quot;/title/finite+decimal+fraction&quot;&gt;finite decimal fraction&lt;/a&gt; can be represented by an infinite decimal fraction by decrementing the last digit and adding a trail of 9's. Thus, the number 0.9999... is the same number as the number 1. This also holds for numbers like 0.4, which can be represented by 0.39999999... &lt;/p&gt;

&lt;p&gt;Note that this is not some kind of &lt;a href=&quot;/title/limit&quot;&gt;limiting&lt;/a&gt; property! It is not so that the number 0.99999... 'approaches' 1. It is, most definitely the same number. In some mathematical proofs, like  the proof that the set of &lt;a href=&quot;/title/real+numbers&quot;&gt;real numbers&lt;/a&gt; is &lt;a href=&quot;/title/uncountable&quot;&gt;uncountable&lt;/a&gt;, special measures have to be taken to eliminate this ambiguity.   That is, the existence of both 0.99999.. and 1 seems to break the proof, but since both are identical, it does not.&lt;/p&gt;

&lt;p&gt;Casual readers may stop here. &lt;a href=&quot;/title/Pedant&quot;&gt;Pedants&lt;/a&gt; read on..&lt;/p&gt;

&lt;p&gt;It has been argued by some that&amp;hellip;</content>
</entry><entry><title>Turing Machine (thing)</title><link rel="alternate" type="text/html" href="http://everything2.com:80/user/irexe/writeups/Turing+Machine"/><id>http://everything2.com:80/user/irexe/writeups/Turing+Machine</id><author><name>irexe</name><uri>http://everything2.com:80/user/irexe</uri></author><published>2002-12-01T14:31:12Z</published><updated>2002-12-01T14:31:12Z</updated>
<content type="html">&lt;blockquote&gt;
 &quot;I should like to eliminate once and for all the questions regarding the foundations of mathematics, in the form in which they are now posed, by turning every mathematical proposition into a formula that can be concretely exhibited and strictly derived, thus recasting mathematical definitions and inferences in such a way that they are unshakable and yet provide an adequate picture of the whole science.&quot; - &lt;a href=&quot;/title/David+Hilbert&quot;&gt;David Hilbert&lt;/a&gt; 
&lt;/blockquote&gt;


&lt;h1&gt;Description&lt;/h1&gt;

&lt;p&gt; 
A Turing Machine (TM) is an imaginary machine, capable of performing &lt;a href=&quot;/title/computation&quot;&gt;computations&lt;/a&gt;. 
It is generally used as a theoretical tool to prove points about computational problems. 
More on that later. One can think of the Turing Machine as a &lt;a href=&quot;/title/computer&quot;&gt;computer&lt;/a&gt;. 
It is neither a very fast nor a very &lt;a href=&quot;/title/efficient&quot;&gt;efficient&lt;/a&gt; computer, but, because of its simplicity, it is a practical tool for the analysis of more complex, real life computers and computing problems. 
Many real-life implementations of Turing Machines do exist an can be&amp;hellip;</content>
</entry><entry><title>October 24, 2002 (idea)</title><link rel="alternate" type="text/html" href="http://everything2.com:80/user/irexe/writeups/October+24%252C+2002"/><id>http://everything2.com:80/user/irexe/writeups/October+24%252C+2002</id><author><name>irexe</name><uri>http://everything2.com:80/user/irexe</uri></author><published>2002-10-24T11:56:27Z</published><updated>2002-10-24T11:56:27Z</updated>
<content type="html">&lt;p&gt;A snippet from today's news from &lt;a href=&quot;/title/the+Netherlands&quot;&gt;the Netherlands&lt;/a&gt;.. 

&lt;blockquote&gt;

&lt;h5&gt;Venlo, October 24 2002&lt;/h5&gt;
&lt;p&gt; The 22 year old man that was assaulted on Tuesday by two 18 year olds died this morning around 2:20. The student suffered a severe beating after he addressed the two boys on their &lt;a href=&quot;/title/reckless+driving&quot;&gt;reckless driving&lt;/a&gt;. Apparently, the boys nearly ran over an elderly lady in the parking lot of a local supermarket. Mr. Steegmans then told the boys to have some respect for the elderly. After &lt;a href=&quot;/title/bludgeoning&quot;&gt;bludgeoning&lt;/a&gt; Mr. Steegmans, the two boys went into the supermarket to do their shopping. They were arrested 
moments later.
&lt;h6&gt;Source: &lt;a href=&quot;/title/NOS&quot;&gt;NOS&lt;/a&gt; news: www.omroep.nl/nos/nieuws/index.html &lt;/h6&gt; 

&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;I got beat up once for no apparent reason, almost two years ago. Me and two of my flatmates were out in &lt;a href=&quot;/title/Delft&quot;&gt;Delft&lt;/a&gt;, where we live. Delft is a small, but not tiny city according to &lt;a href=&quot;/title/Dutch&quot;&gt;Dutch&lt;/a&gt; standards. It has a population of about one hundred thousand people. About one fifth of these are students, including me and my&amp;hellip;</content>
</entry><entry><title>elgooG (thing)</title><link rel="alternate" type="text/html" href="http://everything2.com:80/user/irexe/writeups/elgooG"/><id>http://everything2.com:80/user/irexe/writeups/elgooG</id><author><name>irexe</name><uri>http://everything2.com:80/user/irexe</uri></author><published>2002-09-24T01:12:16Z</published><updated>2002-09-24T01:12:16Z</updated>
<content type="html">&lt;p&gt;&lt;b&gt;The joke..&lt;/b&gt;&lt;/p&gt;

&lt;p&gt;Being proper geeks, the people at &lt;a href=&quot;/title/All+Too+Flat&quot;&gt;All Too Flat&lt;/a&gt; know how to appreciate a  &lt;a href=&quot;/title/pun&quot;&gt;pun&lt;/a&gt;. elgooG is, quite literally, a &lt;a href=&quot;/title/mirror&quot;&gt;mirror&lt;/a&gt; site of the popular internet &lt;a href=&quot;/title/search+engine&quot;&gt;search engine&lt;/a&gt; &lt;a href=&quot;/title/Google&quot;&gt;Google&lt;/a&gt;. The site's graphics and the search interface are exactly identical to that of the original. Well, if you view it in an actual mirror, that is. If you don't have a mirror handy, get used to typing and reading backwards. Likely, this little joke would merely have curled a few mouths amongst some fellow geeks, if not for the &lt;a href=&quot;/title/China&quot;&gt;Chinese&lt;/a&gt;. The Chinese? Yes, the Chinese! Bear with me..    
&lt;/p&gt; 

&lt;p&gt; Apparently, one &lt;a href=&quot;/title/The+Great+Wall+of+China&quot;&gt;Great Wall&lt;/a&gt; wasn't enough for the Chinese government. They decided some time ago that the boundless informational freedom of the &lt;a href=&quot;/title/Internet&quot;&gt;Internet&lt;/a&gt; should not be for their countrymen to enjoy. One way to enforce this policy was to block &lt;a href=&quot;/title/Google&quot;&gt;the most popular search engine&lt;/a&gt;, if only for its large &lt;a href=&quot;/title/cache&quot;&gt;cache&lt;/a&gt; of 'dangerous' data.
Fortunately for the Chinese, geeks are sparse&amp;hellip;</content>
</entry><entry><title>spurious interrupt (thing)</title><link rel="alternate" type="text/html" href="http://everything2.com:80/user/irexe/writeups/spurious+interrupt"/><id>http://everything2.com:80/user/irexe/writeups/spurious+interrupt</id><author><name>irexe</name><uri>http://everything2.com:80/user/irexe</uri></author><published>2002-07-31T09:03:58Z</published><updated>2002-07-31T09:03:58Z</updated>
<content type="html">&lt;p&gt;If you run &lt;a href=&quot;/title/Linux&quot;&gt;Linux&lt;/a&gt;, or perhaps another &lt;a href=&quot;/title/UNIX&quot;&gt;UNIX&lt;/a&gt;-like &lt;a href=&quot;/title/operating+system&quot;&gt;operating system&lt;/a&gt;, you might have noticed the occurence of &lt;a href=&quot;/title/spurious&quot;&gt;spurious&lt;/a&gt; &lt;a href=&quot;/title/interrupt&quot;&gt;interrupt&lt;/a&gt; messages on your &lt;a href=&quot;/title/console&quot;&gt;console&lt;/a&gt; during startup, and sometimes later during operation as well.  Well, in case you were curious, here's the deal:&lt;/p&gt;

&lt;p&gt;&lt;b&gt;In a few words..&lt;/b&gt;&lt;/p&gt;

&lt;p&gt;After the &lt;a href=&quot;/title/bootstrapping&quot;&gt;bootstrapping&lt;/a&gt; of an operating system is complete, the system usually runs several initialisation tasks. One thing the operating system needs to do is to load into memory all &lt;a href=&quot;/title/subroutine&quot;&gt;subroutines&lt;/a&gt; that will handle incoming &lt;a href=&quot;/title/interrupt&quot;&gt;interrupts&lt;/a&gt;. The spurious interrupt is the placeholder interrupt handler that is loaded before all the others are ready, to prevent the CPU from executing random parts of memory as if they were code. Since the spurious interrupt is loaded into all the slots of the interrupt vector, it is also the default handler for all unserviced interrupts. Driver software may sometimes cause software interrupts (&lt;a href=&quot;/title/trap&quot;&gt;traps&lt;/a&gt;) that are incorrect (uncaught). Such&amp;hellip;</content>
</entry><entry><title>cache (thing)</title><link rel="alternate" type="text/html" href="http://everything2.com:80/user/irexe/writeups/cache"/><id>http://everything2.com:80/user/irexe/writeups/cache</id><author><name>irexe</name><uri>http://everything2.com:80/user/irexe</uri></author><published>2002-07-30T17:43:48Z</published><updated>2002-07-30T17:43:48Z</updated>
<content type="html">&lt;h1&gt;Background&lt;/h1&gt;

&lt;p&gt;At the heart of most modern computers lies the central processing unit or 
&lt;a href=&quot;/title/CPU&quot;&gt;CPU&lt;/a&gt;. It is quite often the fastest and most expensive part of the machine. 
The CPU operates on data and programs which reside in the computer's &lt;a href=&quot;/title/main+memory&quot;&gt;main 
memory&lt;/a&gt; &lt;a href=&quot;/title/chips&quot;&gt;chips&lt;/a&gt;. The CPU fetches programs from the main memory one 
instruction at a time and executes them. Quite often, the CPU will have to 
fetch additional information from the memory, such as data on which a 
calculation is to be performed. The CPU runs according to a clock. This clock 
sends out pulses. At each pulse, the CPU will go one step further in this 
&lt;a href=&quot;/title/FDE&quot;&gt;fetch decode execute cycle&lt;/a&gt;. &lt;/p&gt;

&lt;p&gt; From this very simple sketch, it should be clear that the communication 
with main memory needs to be very fast: it would be unacceptable if it took a 
CPU only one clock cycle to execute an instruction, but ten clockcycles to 
fetch the instruction from main memory. It would be possible to construct 
memory in such a manner that its&amp;hellip;</content>
</entry></feed>
