<?xml version="1.0" encoding="utf-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Gaming&#8217;s Rapidly Refreshing Theory</title>
	<atom:link href="http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/feed/" rel="self" type="application/rss+xml" />
	<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/</link>
	<description>A group blog about computer narrative, games, poetry, and art.</description>
	<lastBuildDate>Wed, 13 Jan 2010 15:44:40 -0800</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.5</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Grand Text Auto &#187; Postmodern Programming Tackles Primes</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-411754</link>
		<dc:creator>Grand Text Auto &#187; Postmodern Programming Tackles Primes</dc:creator>
		<pubDate>Mon, 09 Feb 2009 15:00:36 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-411754</guid>
		<description>[...] long while ago Gilbert Bernstein discussed process intensity and programming with us in the comment section after my review of Alex Galloway&#8217;s Gaming. I mentioned one of [...]</description>
		<content:encoded><![CDATA[<p>[...] long while ago Gilbert Bernstein discussed process intensity and programming with us in the comment section after my review of Alex Galloway&#8217;s Gaming. I mentioned one of [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Walter</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98934</link>
		<dc:creator>Walter</dc:creator>
		<pubDate>Thu, 19 Oct 2006 16:35:10 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98934</guid>
		<description>We just got done discussing Crawford&#039;s article and a related one by Greg Costikyan (not his new one, but we did discuss that a bit) in Expressive Computation here at GATech, but I&#039;ve been mulling over this question of what we&#039;re really trying to get at with the term &quot;process intensity&quot; since reading this thread.  I think the concept we&#039;re really looking for is one of articulation (computational or representational articulation, articulation complexity), recalling the term &quot;points of articulation&quot; that people use to talk about, say, action figures.  Instead of looking at processes and computation, which are a bit too general, we should be thinking about the ontology on which a program can operate to articulate meanings, and the complexity of articulation it affords.  So while an FMV playback program can articulate color value, pixel placement, audio variables, etc., a videogame can potentially articulate on the same levels as well as on the level of individual game objects (there&#039;s a big gap in fidelity, of course, when comparing Dragon&#039;s Lair to a more typical videogame from the same time period).  With word processors, the user can re-articulate the data already there to create new meanings (by cutting and pasting), whereas the typewriter generally has no capacity to re-articulate the user&#039;s existing data at all.</description>
		<content:encoded><![CDATA[<p>We just got done discussing Crawford&#8217;s article and a related one by Greg Costikyan (not his new one, but we did discuss that a bit) in Expressive Computation here at GATech, but I&#8217;ve been mulling over this question of what we&#8217;re really trying to get at with the term &#8220;process intensity&#8221; since reading this thread.  I think the concept we&#8217;re really looking for is one of articulation (computational or representational articulation, articulation complexity), recalling the term &#8220;points of articulation&#8221; that people use to talk about, say, action figures.  Instead of looking at processes and computation, which are a bit too general, we should be thinking about the ontology on which a program can operate to articulate meanings, and the complexity of articulation it affords.  So while an FMV playback program can articulate color value, pixel placement, audio variables, etc., a videogame can potentially articulate on the same levels as well as on the level of individual game objects (there&#8217;s a big gap in fidelity, of course, when comparing Dragon&#8217;s Lair to a more typical videogame from the same time period).  With word processors, the user can re-articulate the data already there to create new meanings (by cutting and pasting), whereas the typewriter generally has no capacity to re-articulate the user&#8217;s existing data at all.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: scott</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98224</link>
		<dc:creator>scott</dc:creator>
		<pubDate>Fri, 29 Sep 2006 07:23:09 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98224</guid>
		<description>I like recipe programs. Recipe databases are the most useful aspect of the contemporary Web from the perspective of the gourmand or amateur chef. PCs will only have truly advanced however, when they sport actual process-intensive cooking capabilities, as per the Jetsons. At that point it will truly make sense to consider a high crunch per bit ratio into the value equation. And why not? We have robot vacuum cleaners.</description>
		<content:encoded><![CDATA[<p>I like recipe programs. Recipe databases are the most useful aspect of the contemporary Web from the perspective of the gourmand or amateur chef. PCs will only have truly advanced however, when they sport actual process-intensive cooking capabilities, as per the Jetsons. At that point it will truly make sense to consider a high crunch per bit ratio into the value equation. And why not? We have robot vacuum cleaners.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: nick</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98200</link>
		<dc:creator>nick</dc:creator>
		<pubDate>Fri, 29 Sep 2006 02:28:25 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98200</guid>
		<description>Noah, I agree that there are ways to refine this metric to highlight the computation that is making contributions rather than just spinning the processor. At the same time, I don&#039;t mean to map &quot;computation&quot; to &quot;doing interesting stuff.&quot;

Perhaps in distinction to Crawford, I&#039;m not introducing this playback-computation idea only to say that playback is bad. My comments have tended to snub playback a bit, but I don&#039;t think games get monotonically better the less playback they have. &lt;i&gt;Dragon&#039;s Lair&lt;/i&gt; is an interesting game, and was innovative because of how it used more playback than other games of that time.

Even the recipe program with fancy rendering has more potential to render different scenes (perhaps untapped) coded into it; whether this is an interesting capability or whether this power is used is another matter. The player&#039;s actions (considered on the operator-machine axis) can be &quot;thrown away&quot; or can cause no significant, high-level change, as with additional computation, but it&#039;s still useful to look at both axes.</description>
		<content:encoded><![CDATA[<p>Noah, I agree that there are ways to refine this metric to highlight the computation that is making contributions rather than just spinning the processor. At the same time, I don&#8217;t mean to map &#8220;computation&#8221; to &#8220;doing interesting stuff.&#8221;</p>
<p>Perhaps in distinction to Crawford, I&#8217;m not introducing this playback-computation idea only to say that playback is bad. My comments have tended to snub playback a bit, but I don&#8217;t think games get monotonically better the less playback they have. <i>Dragon&#8217;s Lair</i> is an interesting game, and was innovative because of how it used more playback than other games of that time.</p>
<p>Even the recipe program with fancy rendering has more potential to render different scenes (perhaps untapped) coded into it; whether this is an interesting capability or whether this power is used is another matter. The player&#8217;s actions (considered on the operator-machine axis) can be &#8220;thrown away&#8221; or can cause no significant, high-level change, as with additional computation, but it&#8217;s still useful to look at both axes.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: nick</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98197</link>
		<dc:creator>nick</dc:creator>
		<pubDate>Fri, 29 Sep 2006 02:18:45 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98197</guid>
		<description>Gilbert, I like having conversations on the blog, as we all do here, so, thanks for the replies.

The example I&#039;m using comes from Edsgar W. Dijkstra, specifically &lt;a href=&quot;http://www.cs.utexas.edu/users/EWD/ewd02xx/EWD227.PDF&quot; rel=&quot;nofollow&quot;&gt;EWD277.&lt;/a&gt; The only thing Dijkstra says about the program that prints a stored list of 1000 prime numbers is that it is an &quot;obvious version of the program&quot; and &quot;We shall not pursue this version, as it would imply that the programmer hardly needed the machine at all.&quot;

One can find two programs, one using playback and one using computation, to do anything that can be computed. The differing time/space requirements may not even be perceptible; there may be no perceptible difference at all in terms of output or runs. But a video game or other program that does almost nothing but playback is one in which the programmer hardly needs the machine at all. It&#039;s not just a matter of the author&#039;s conception of the program. With such a program, the function implemented cannot be general and is less likely to be interesting.

To relate this to one of Galloway&#039;s axes, operator-machine: If we take a particular ten minutes of play of &lt;i&gt;Grand Theft Auto: Vice City,&lt;/i&gt; capture video of it, and then play back the video, our video does exactly the same thing that the video game did in terms of output. We could say that having a video vs. having the game (manipulated in a certain way) is just a matter of time/space tradeoff. But that misses the point that we have an interactive computer program in one case - capable of dealing with input and doing something else as well as what it did - and a video that can do only one thing in the other case.

&lt;i&gt;Dragon&#039;s Lair&lt;/i&gt; is interactive, but consists of the playback of clips of video; characterizing it along the operator-machine axis as well as the playback-computation one helps to differentiate it from, say, a turn-based strategy game like &lt;i&gt;Advance Wars&lt;/i&gt; in which there are (similarly) limited points of control, but what happens is being generated at least in part rather than being played back.

I&#039;m quite interested in understanding new media at the level of computer systems and organization as well, but what I&#039;m trying to get at here is not really at this level. It also isn&#039;t just a question of how the author thought about things, although that is important, too. Instead, it&#039;s meant to be an aspect of how the program functions, as Galloway&#039;s two axes are.</description>
		<content:encoded><![CDATA[<p>Gilbert, I like having conversations on the blog, as we all do here, so, thanks for the replies.</p>
<p>The example I&#8217;m using comes from Edsgar W. Dijkstra, specifically <a href="http://www.cs.utexas.edu/users/EWD/ewd02xx/EWD227.PDF" rel="nofollow">EWD277.</a> The only thing Dijkstra says about the program that prints a stored list of 1000 prime numbers is that it is an &#8220;obvious version of the program&#8221; and &#8220;We shall not pursue this version, as it would imply that the programmer hardly needed the machine at all.&#8221;</p>
<p>One can find two programs, one using playback and one using computation, to do anything that can be computed. The differing time/space requirements may not even be perceptible; there may be no perceptible difference at all in terms of output or runs. But a video game or other program that does almost nothing but playback is one in which the programmer hardly needs the machine at all. It&#8217;s not just a matter of the author&#8217;s conception of the program. With such a program, the function implemented cannot be general and is less likely to be interesting.</p>
<p>To relate this to one of Galloway&#8217;s axes, operator-machine: If we take a particular ten minutes of play of <i>Grand Theft Auto: Vice City,</i> capture video of it, and then play back the video, our video does exactly the same thing that the video game did in terms of output. We could say that having a video vs. having the game (manipulated in a certain way) is just a matter of time/space tradeoff. But that misses the point that we have an interactive computer program in one case &#8211; capable of dealing with input and doing something else as well as what it did &#8211; and a video that can do only one thing in the other case.</p>
<p><i>Dragon&#8217;s Lair</i> is interactive, but consists of the playback of clips of video; characterizing it along the operator-machine axis as well as the playback-computation one helps to differentiate it from, say, a turn-based strategy game like <i>Advance Wars</i> in which there are (similarly) limited points of control, but what happens is being generated at least in part rather than being played back.</p>
<p>I&#8217;m quite interested in understanding new media at the level of computer systems and organization as well, but what I&#8217;m trying to get at here is not really at this level. It also isn&#8217;t just a question of how the author thought about things, although that is important, too. Instead, it&#8217;s meant to be an aspect of how the program functions, as Galloway&#8217;s two axes are.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: noah</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98194</link>
		<dc:creator>noah</dc:creator>
		<pubDate>Fri, 29 Sep 2006 01:48:21 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98194</guid>
		<description>Nick, I think Crawford&#039;s talking about process intensity as a way to understand why software proposals such as recipe programs and checkbook balancers for early PCs were bad ideas. They&#039;re bad ideas because very little processing goes into what they do, into how they behave. But when Crawford formulates this as the &quot;crunch per bit&quot; ratio this focus on program behavior is lost.

What I&#039;m saying is that I think a recipe program, even if it used fancy rendering to achieve a high crunch per bit ratio, would still make sense to place &quot;low&quot; on the process intensity scale. We just need to stop thinking of process intensity as &quot;crunch per bit&quot; and instead as something like &quot;crunch per behavior&quot; or &quot;crunch per decision&quot;.</description>
		<content:encoded><![CDATA[<p>Nick, I think Crawford&#8217;s talking about process intensity as a way to understand why software proposals such as recipe programs and checkbook balancers for early PCs were bad ideas. They&#8217;re bad ideas because very little processing goes into what they do, into how they behave. But when Crawford formulates this as the &#8220;crunch per bit&#8221; ratio this focus on program behavior is lost.</p>
<p>What I&#8217;m saying is that I think a recipe program, even if it used fancy rendering to achieve a high crunch per bit ratio, would still make sense to place &#8220;low&#8221; on the process intensity scale. We just need to stop thinking of process intensity as &#8220;crunch per bit&#8221; and instead as something like &#8220;crunch per behavior&#8221; or &#8220;crunch per decision&#8221;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Gilbert Bernstein</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98191</link>
		<dc:creator>Gilbert Bernstein</dc:creator>
		<pubDate>Fri, 29 Sep 2006 01:25:38 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98191</guid>
		<description>I suppose it&#039;s just that I don&#039;t see what the significance of computing vs. storing the first 1000 prime numbers is beyond a time/space complexity tradeoff.  Perhaps if one didn&#039;t scale, but regardless of which approach is used for the first 1000 numbers, the rest could still be computed with the sieve.  The only difference between the two perceptible from the other side of the function abstraction is differing time/space requirements.

I mean, any process on a computer ends up being a function, and mathematically a table (vector) of values is just a function too. (albeit with a finite domain, though this could easily represent a finite partitioning of an infinite domain)  I can make a table lookup very complicated and look like a function, or I can make a function look very much like a table lookup.  I can take a function which doesn&#039;t use tables at all and pre-compute a common case table to speed up execution.  Regardless, I&#039;m left with, mathematically, the same function.  It&#039;s just written differently.

Maybe, is the point is to talk about how the author conceives of and writes the process rather than what the actual process going on is?

ps. sorry if I&#039;m being confrontational.  I&#039;m just trying to get a handle on the concept

... I really do like the blog. =)</description>
		<content:encoded><![CDATA[<p>I suppose it&#8217;s just that I don&#8217;t see what the significance of computing vs. storing the first 1000 prime numbers is beyond a time/space complexity tradeoff.  Perhaps if one didn&#8217;t scale, but regardless of which approach is used for the first 1000 numbers, the rest could still be computed with the sieve.  The only difference between the two perceptible from the other side of the function abstraction is differing time/space requirements.</p>
<p>I mean, any process on a computer ends up being a function, and mathematically a table (vector) of values is just a function too. (albeit with a finite domain, though this could easily represent a finite partitioning of an infinite domain)  I can make a table lookup very complicated and look like a function, or I can make a function look very much like a table lookup.  I can take a function which doesn&#8217;t use tables at all and pre-compute a common case table to speed up execution.  Regardless, I&#8217;m left with, mathematically, the same function.  It&#8217;s just written differently.</p>
<p>Maybe, is the point is to talk about how the author conceives of and writes the process rather than what the actual process going on is?</p>
<p>ps. sorry if I&#8217;m being confrontational.  I&#8217;m just trying to get a handle on the concept</p>
<p>&#8230; I really do like the blog. =)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: nick</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98174</link>
		<dc:creator>nick</dc:creator>
		<pubDate>Thu, 28 Sep 2006 23:05:54 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98174</guid>
		<description>Crawford is not misunderstanding modern computing. His point as I understand it does not relate to how programs and data are stored in a computer. The Von Neumann architecture simply stores the bits relating to both programs and data in the same way, which hardly eradicates all distinction between them. The Harvard architecture doesn&#039;t do this, and recent innovations such as the NX (no execute) bit that AMD introduced bring an architectural distinction between programs and data back into modern computing.

But none of this really matters when it comes to process intensity. I like considering instruction set architectures as much as the next girl, but process intensity isn&#039;t directly about CPU utilization or things that are more detailed. Printing 1000 prime numbers from a file is less process intensive than is actually computing those numbers; It&#039;s useful to characterize creative computing along this dimension to understand what is going on in it.</description>
		<content:encoded><![CDATA[<p>Crawford is not misunderstanding modern computing. His point as I understand it does not relate to how programs and data are stored in a computer. The Von Neumann architecture simply stores the bits relating to both programs and data in the same way, which hardly eradicates all distinction between them. The Harvard architecture doesn&#8217;t do this, and recent innovations such as the NX (no execute) bit that AMD introduced bring an architectural distinction between programs and data back into modern computing.</p>
<p>But none of this really matters when it comes to process intensity. I like considering instruction set architectures as much as the next girl, but process intensity isn&#8217;t directly about CPU utilization or things that are more detailed. Printing 1000 prime numbers from a file is less process intensive than is actually computing those numbers; It&#8217;s useful to characterize creative computing along this dimension to understand what is going on in it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Gilbert Bernstein</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98156</link>
		<dc:creator>Gilbert Bernstein</dc:creator>
		<pubDate>Thu, 28 Sep 2006 21:17:08 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98156</guid>
		<description>Maybe as mark says, Crawford&#039;s process intensity might work as a rule of thumb, but its grounding in computation is still problematic when viewed from the technical standpoint.  In particular, the  following, from the beginning of Crawford&#039;s article, seems to indicate a misunderstanding of what modern computation is:

&quot;The difference between process and data is profound. Process is abstract where data is tangible. Data is direct, where process is indirect. The difference between data and process is the difference between numbers and equations, between facts and principles, between events and forces, between knowledge and ideas.

Processing data is the very essence of what a computer does.&quot;

The key insight of the Von Neumann Machine (ie. every modern computer) is the &quot;stored program&quot; or that process is data; there is no fundamental difference between the two.  Crawford also distinguishes between just moving data and processing, but at ISA level these are really both just instructions.  What appears to be computation at one level of abstraction may actually involve moving quite a bit of data shunting, and likewise a request to move data can often be abstracted such that nothing is actually moved in some cases.

It seems to me that if process intensity is to be a useful concept, process and data need to be expressed such that they don&#039;t appeal to the lower level, and highly abstract world of arithmetical operations and primitive data types.</description>
		<content:encoded><![CDATA[<p>Maybe as mark says, Crawford&#8217;s process intensity might work as a rule of thumb, but its grounding in computation is still problematic when viewed from the technical standpoint.  In particular, the  following, from the beginning of Crawford&#8217;s article, seems to indicate a misunderstanding of what modern computation is:</p>
<p>&#8220;The difference between process and data is profound. Process is abstract where data is tangible. Data is direct, where process is indirect. The difference between data and process is the difference between numbers and equations, between facts and principles, between events and forces, between knowledge and ideas.</p>
<p>Processing data is the very essence of what a computer does.&#8221;</p>
<p>The key insight of the Von Neumann Machine (ie. every modern computer) is the &#8220;stored program&#8221; or that process is data; there is no fundamental difference between the two.  Crawford also distinguishes between just moving data and processing, but at ISA level these are really both just instructions.  What appears to be computation at one level of abstraction may actually involve moving quite a bit of data shunting, and likewise a request to move data can often be abstracted such that nothing is actually moved in some cases.</p>
<p>It seems to me that if process intensity is to be a useful concept, process and data need to be expressed such that they don&#8217;t appeal to the lower level, and highly abstract world of arithmetical operations and primitive data types.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: mark</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98141</link>
		<dc:creator>mark</dc:creator>
		<pubDate>Thu, 28 Sep 2006 18:56:23 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98141</guid>
		<description>Even as far as intensity of the processes that determine system behavior, I&#039;d guess what really matters is some more abstract idea of &quot;process&quot; than literal code-crunching---rewriting code so that it does the same thing more efficiently than before would reduce a &quot;crunch-per-bit&quot; in a literal count of machine instructions per bit of data, but surely that doesn&#039;t reduce the degree of procedurality in a meaningful way.  I read Crawford as presenting it as more of a rule of thumb, although it might be problematic even as that when dealing with AI-ish sort of stuff, since AI stuff varies wildly in computational complexity, not always in ways that have much to do with what a player would observe.</description>
		<content:encoded><![CDATA[<p>Even as far as intensity of the processes that determine system behavior, I&#8217;d guess what really matters is some more abstract idea of &#8220;process&#8221; than literal code-crunching&#8212;rewriting code so that it does the same thing more efficiently than before would reduce a &#8220;crunch-per-bit&#8221; in a literal count of machine instructions per bit of data, but surely that doesn&#8217;t reduce the degree of procedurality in a meaningful way.  I read Crawford as presenting it as more of a rule of thumb, although it might be problematic even as that when dealing with AI-ish sort of stuff, since AI stuff varies wildly in computational complexity, not always in ways that have much to do with what a player would observe.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: nick</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98140</link>
		<dc:creator>nick</dc:creator>
		<pubDate>Thu, 28 Sep 2006 18:56:01 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98140</guid>
		<description>I don&#039;t really see a problem with Crawford&#039;s concept. One program prints a list of 1000 prime numbers that is stored in a file as data. Another program computes these 1000 prime numbers using the Sieve of Eratosthenes. The second one is clearly more process intensive. You can&#039;t tell from the output that they are different, but you can tell from the program - and the fact that the second program will easily generalize to any number range, while the first will not.

If some programs are doing &quot;wasted&quot; computation (computing something and throwing the results away), or have a lot of overhead because all programs that run on a particular platform have such overhead, they might look more process intensive than they are. So you can remove the wasted and baseline computation before figuring out where they lie along this axis, and the &quot;crunch per bit&quot; tells you what useful computation is happening.

Distinguishing diegetic and extradiegetic texts seems like a harder problem in many cases, but I think it&#039;s similarly useful to consider.</description>
		<content:encoded><![CDATA[<p>I don&#8217;t really see a problem with Crawford&#8217;s concept. One program prints a list of 1000 prime numbers that is stored in a file as data. Another program computes these 1000 prime numbers using the Sieve of Eratosthenes. The second one is clearly more process intensive. You can&#8217;t tell from the output that they are different, but you can tell from the program &#8211; and the fact that the second program will easily generalize to any number range, while the first will not.</p>
<p>If some programs are doing &#8220;wasted&#8221; computation (computing something and throwing the results away), or have a lot of overhead because all programs that run on a particular platform have such overhead, they might look more process intensive than they are. So you can remove the wasted and baseline computation before figuring out where they lie along this axis, and the &#8220;crunch per bit&#8221; tells you what useful computation is happening.</p>
<p>Distinguishing diegetic and extradiegetic texts seems like a harder problem in many cases, but I think it&#8217;s similarly useful to consider.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: noah</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98134</link>
		<dc:creator>noah</dc:creator>
		<pubDate>Thu, 28 Sep 2006 18:38:03 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98134</guid>
		<description>Well, that&#039;s one of the problems with Crawford&#039;s concept. The &quot;crunch per bit&quot; ratio doesn&#039;t really tell you what that crunching is for, and it might just be, say, to project Doom II in stereo onto the walls of the Cave. It&#039;s a lot more computationally intensive, and it&#039;s pretty cool looking, but the behavior of the system is exactly the same. You could send &quot;crunch per bit&quot; through the roof by adding a bunch of transparency effects and real-time textures to Crawford&#039;s example of the kitchen recipe program. Clearly, &quot;crunch per bit&quot; is not what Crawford&#039;s really trying to talk about. 

Of course, I haven&#039;t read everything he&#039;s written. Has he expanded on the concept somewhere and dealt with this? I think the important issue is the intensity of the processes that determine the system behavior, but then maybe we need a longer term -- like &quot;behavioral process intensity.&quot;</description>
		<content:encoded><![CDATA[<p>Well, that&#8217;s one of the problems with Crawford&#8217;s concept. The &#8220;crunch per bit&#8221; ratio doesn&#8217;t really tell you what that crunching is for, and it might just be, say, to project Doom II in stereo onto the walls of the Cave. It&#8217;s a lot more computationally intensive, and it&#8217;s pretty cool looking, but the behavior of the system is exactly the same. You could send &#8220;crunch per bit&#8221; through the roof by adding a bunch of transparency effects and real-time textures to Crawford&#8217;s example of the kitchen recipe program. Clearly, &#8220;crunch per bit&#8221; is not what Crawford&#8217;s really trying to talk about. </p>
<p>Of course, I haven&#8217;t read everything he&#8217;s written. Has he expanded on the concept somewhere and dealt with this? I think the important issue is the intensity of the processes that determine the system behavior, but then maybe we need a longer term &#8212; like &#8220;behavioral process intensity.&#8221;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: nick</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98123</link>
		<dc:creator>nick</dc:creator>
		<pubDate>Thu, 28 Sep 2006 16:47:22 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98123</guid>
		<description>I&#039;m just talking about what Chris Crawford calls &lt;a href=&quot;http://www.erasmatazz.com/library/JCGD_Volume_1/Process_Intensity.html&quot; rel=&quot;nofollow&quot;&gt;process intensity,&lt;/a&gt; as discussed on here before &lt;a href=&quot;http://grandtextauto.org/2005/03/23/fever-addled-impressions-of-gdc/&quot; rel=&quot;nofollow&quot;&gt;by Michael.&lt;/a&gt;</description>
		<content:encoded><![CDATA[<p>I&#8217;m just talking about what Chris Crawford calls <a href="http://www.erasmatazz.com/library/JCGD_Volume_1/Process_Intensity.html" rel="nofollow">process intensity,</a> as discussed on here before <a href="http://grandtextauto.org/2005/03/23/fever-addled-impressions-of-gdc/" rel="nofollow">by Michael.</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: noah</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98114</link>
		<dc:creator>noah</dc:creator>
		<pubDate>Thu, 28 Sep 2006 15:01:44 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98114</guid>
		<description>I have the book, and it&#039;s high on my agenda, but this summer didn&#039;t allow much time for reading. Given I haven&#039;t read the book in question yet, the most appropriate things for me to comment on here are Nick&#039;s ideas. 

It sounds to me like the dimension of &quot;computation vs. playback&quot; is meant to express (somewhat as Gilbert suggests above) the amount of potential computational variability. It may take some computation to decompress some FMV and shove it on screen, but there&#039;s no potential for variability there. On the other hand, AI-driven NPC behavior has much potential for variability.

Of course, this still leaves us with things like procedural textures. They have potential for variation (just tweak the parameters) but usually this potential can&#039;t be realized via player actions. I&#039;m guessing this puts them somewhere in the middle of the computation/playback axis, but I&#039;d be curious to hear Nick&#039;s thoughts on this...</description>
		<content:encoded><![CDATA[<p>I have the book, and it&#8217;s high on my agenda, but this summer didn&#8217;t allow much time for reading. Given I haven&#8217;t read the book in question yet, the most appropriate things for me to comment on here are Nick&#8217;s ideas. </p>
<p>It sounds to me like the dimension of &#8220;computation vs. playback&#8221; is meant to express (somewhat as Gilbert suggests above) the amount of potential computational variability. It may take some computation to decompress some FMV and shove it on screen, but there&#8217;s no potential for variability there. On the other hand, AI-driven NPC behavior has much potential for variability.</p>
<p>Of course, this still leaves us with things like procedural textures. They have potential for variation (just tweak the parameters) but usually this potential can&#8217;t be realized via player actions. I&#8217;m guessing this puts them somewhere in the middle of the computation/playback axis, but I&#8217;d be curious to hear Nick&#8217;s thoughts on this&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Gilbert Bernstein</title>
		<link>http://grandtextauto.org/2006/09/27/gamings-rapidly-refreshing-theory/comment-page-1/#comment-98009</link>
		<dc:creator>Gilbert Bernstein</dc:creator>
		<pubDate>Wed, 27 Sep 2006 23:18:36 +0000</pubDate>
		<guid isPermaLink="false">http://grandtextauto.org/?p=1306#comment-98009</guid>
		<description>a comment (without having read the book)

In your comment for essay 1, you suggest the addition of a third dimension, computation vs. playback.  Being very tech nerdy about it, there&#039;s quite a bit of computation involved in playback, and there are many things that might be seen as playback, but are actually done with quite a bit of computation, such as (for a somewhat trivial example) procedural texture generation.  We might classify this as non-diegetic, computational, and machine controlled, but we would also classify tactical behavior in Counterstrike bots in the same way.  The problem is that from the perspective of the average player these are different; the procedural textures are just being played back.  Maybe it would be better to clarify computation as being context sensitive, by which I mean the computer is reacting to whatever has been classified as external stimuli. (ie. other computer agents, the physics, players, etc.)</description>
		<content:encoded><![CDATA[<p>a comment (without having read the book)</p>
<p>In your comment for essay 1, you suggest the addition of a third dimension, computation vs. playback.  Being very tech nerdy about it, there&#8217;s quite a bit of computation involved in playback, and there are many things that might be seen as playback, but are actually done with quite a bit of computation, such as (for a somewhat trivial example) procedural texture generation.  We might classify this as non-diegetic, computational, and machine controlled, but we would also classify tactical behavior in Counterstrike bots in the same way.  The problem is that from the perspective of the average player these are different; the procedural textures are just being played back.  Maybe it would be better to clarify computation as being context sensitive, by which I mean the computer is reacting to whatever has been classified as external stimuli. (ie. other computer agents, the physics, players, etc.)</p>
]]></content:encoded>
	</item>
</channel>
</rss>
