Regularity

From Maze

(Difference between revisions)
Jump to: navigation, search
(→Iteration – code and structures)
(→Repeating: Regularity in Time and Process)
Line 40:Line 40:
Although there is no IF ... THEN statement in 10 PRINT, and the program does not by any interpretation contain a conditional branch, this short program does accomplish a very small-scale sort of variation. By computing 205.5+RND(1) and passing that value to the function CHR$, the program prints either PETSCII character 205 or PETSCII character 206. This variation between two characters is a one-bit variation, a selection from the smallest possible set of options. Yet, in combination with the regularity of a repeating processes and the regularity of the Commodore 64's screen grid, these selections take shape as something evocative and visually interesting.
Although there is no IF ... THEN statement in 10 PRINT, and the program does not by any interpretation contain a conditional branch, this short program does accomplish a very small-scale sort of variation. By computing 205.5+RND(1) and passing that value to the function CHR$, the program prints either PETSCII character 205 or PETSCII character 206. This variation between two characters is a one-bit variation, a selection from the smallest possible set of options. Yet, in combination with the regularity of a repeating processes and the regularity of the Commodore 64's screen grid, these selections take shape as something evocative and visually interesting.
−
 
−
=== Iteration – software and business= ==
 
−
==== Mechanical reproduction ====
 
−
==== Version 1.0 ====
 
−
==== Break ====
 
−
 
−
== Iteration as a Generalized Process ==
 
−
=== Bread and Beer ===
 
−
=== Fractals and Chaos ===
 
−
=== Life ===
 
−
==Works Cited==
 
−
 
−
Anon. 1964. BASIC. Dartmouth College: Computation Center.
 

Revision as of 09:02, 19 July 2011

View this revision of Regularity.

Personal tools