<?xml version="1.0" encoding="UTF-8" ?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:base="http://everything2.com/">
    <title>paulsc's New Writeups</title>
    <link rel="alternate" type="text/html" href="http://everything2.com/index.pl?node=Everything%20User%20Search&amp;usersearch=paulsc" />
    <link rel="self" type="application/atom+xml" href="?node=New%20Writeups%20Atom%20Feed&amp;type=ticker&amp;foruser=paulsc" />
    <id>http://everything2.com/?node=New%20Writeups%20Atom%20Feed&amp;foruser=paulsc</id>
    <updated>1999-11-13T09:09:28Z</updated>
<entry><title>limit case (idea)</title><link rel="alternate" type="text/html" href="http://everything2.com:80/user/paulsc/writeups/limit+case"/><id>http://everything2.com:80/user/paulsc/writeups/limit+case</id><author><name>paulsc</name><uri>http://everything2.com:80/user/paulsc</uri></author><published>1999-11-13T09:09:28Z</published><updated>1999-11-13T09:09:28Z</updated>
<content type="html">&lt;p&gt;A term from &lt;a href=&quot;/title/calculus&quot;&gt;calculus&lt;/a&gt;, indicating an &lt;a href=&quot;/title/unattainable&quot;&gt;unattainable&lt;/a&gt; &lt;a href=&quot;/title/bounding+condition&quot;&gt;bounding condition&lt;/a&gt;, which can be approached, but not achieved.&lt;/p&gt;</content>
</entry><entry><title>data set (idea)</title><link rel="alternate" type="text/html" href="http://everything2.com:80/user/paulsc/writeups/data+set"/><id>http://everything2.com:80/user/paulsc/writeups/data+set</id><author><name>paulsc</name><uri>http://everything2.com:80/user/paulsc</uri></author><published>1999-11-13T08:59:45Z</published><updated>1999-11-13T08:59:45Z</updated>
<content type="html">&lt;p&gt;A data set is a group of &lt;a href=&quot;/title/records&quot;&gt;records&lt;/a&gt; related to one another by internal or external means of organization. &lt;a href=&quot;/title/Database&quot;&gt;Database&lt;/a&gt; &lt;a href=&quot;/title/programs&quot;&gt;programs&lt;/a&gt; are designed to store and manipulate data sets.&lt;/p&gt;</content>
</entry><entry><title>information space (idea)</title><link rel="alternate" type="text/html" href="http://everything2.com:80/user/paulsc/writeups/information+space"/><id>http://everything2.com:80/user/paulsc/writeups/information+space</id><author><name>paulsc</name><uri>http://everything2.com:80/user/paulsc</uri></author><published>1999-11-13T08:59:44Z</published><updated>1999-11-13T08:59:44Z</updated>
<content type="html">&lt;p&gt;An information space is a &lt;a href=&quot;/title/data+set&quot;&gt;data set&lt;/a&gt; navigable by means of an associated or embedded &lt;a href=&quot;/title/decision+tree&quot;&gt;decision tree&lt;/a&gt; by use of &lt;a href=&quot;/title/programs&quot;&gt;programs&lt;/a&gt;. Sometimes refers to the visualation of such combinations into relational mappings.&lt;/p&gt;</content>
</entry><entry><title>decision tree (idea)</title><link rel="alternate" type="text/html" href="http://everything2.com:80/user/paulsc/writeups/decision+tree"/><id>http://everything2.com:80/user/paulsc/writeups/decision+tree</id><author><name>paulsc</name><uri>http://everything2.com:80/user/paulsc</uri></author><published>1999-11-13T08:59:44Z</published><updated>1999-11-13T08:59:44Z</updated>
<content type="html">&lt;p&gt;A decision tree is a mapping of all possible &lt;a href=&quot;/title/choices&quot;&gt;choices&lt;/a&gt; and &lt;a href=&quot;/title/outcomes&quot;&gt;outcomes&lt;/a&gt; included in an &lt;a href=&quot;/title/information+space&quot;&gt;information space&lt;/a&gt;.&lt;/p&gt;</content>
</entry><entry><title>rich (idea)</title><link rel="alternate" type="text/html" href="http://everything2.com:80/user/paulsc/writeups/rich"/><id>http://everything2.com:80/user/paulsc/writeups/rich</id><author><name>paulsc</name><uri>http://everything2.com:80/user/paulsc</uri></author><published>1999-11-13T08:59:43Z</published><updated>1999-11-13T08:59:43Z</updated>
<content type="html">&lt;p&gt;An &lt;a href=&quot;/title/information+space&quot;&gt;information space&lt;/a&gt; is said to be &quot;rich&quot; if offers its &lt;a href=&quot;/title/users&quot;&gt;users&lt;/a&gt; significant numbers of branches in a &lt;a href=&quot;/title/decision+tree&quot;&gt;decision tree&lt;/a&gt; of &lt;a href=&quot;/title/non-trivial&quot;&gt;non-trivial&lt;/a&gt; depth.&lt;/p&gt;</content>
</entry><entry><title>use the source (idea)</title><link rel="alternate" type="text/html" href="http://everything2.com:80/user/paulsc/writeups/use+the+source"/><id>http://everything2.com:80/user/paulsc/writeups/use+the+source</id><author><name>paulsc</name><uri>http://everything2.com:80/user/paulsc</uri></author><published>1999-11-13T08:59:40Z</published><updated>1999-11-13T08:59:40Z</updated>
<content type="html">&lt;p&gt;Beginning programmers are occasionally enjoined to &quot;use the &lt;a href=&quot;/title/source&quot;&gt;source&lt;/a&gt;&quot; when attempting to &lt;a href=&quot;/title/hack&quot;&gt;hack&lt;/a&gt;.  Properly commented &lt;a href=&quot;/title/source+code&quot;&gt;source code&lt;/a&gt; should contain basic descriptions of the &lt;a href=&quot;/title/logic&quot;&gt;logic&lt;/a&gt; used to solve a particular problem, and is often a better &lt;a href=&quot;/title/reference&quot;&gt;reference&lt;/a&gt; than other &lt;a href=&quot;/title/documentation&quot;&gt;documentation&lt;/a&gt; as to how a &lt;a href=&quot;/title/program&quot;&gt;program&lt;/a&gt; actually functions, and why it is written the way it is.&lt;/p&gt;</content>
</entry></feed>
