[Subversion Wiki] Update of "FS2/Theory" by brane

[Apache subversion Wiki]

Dear Wiki user,

You have subscribed to a wiki page or wiki category on "Subversion Wiki" for 
change notification.

The "FS2/Theory" page has been changed by brane:
http://wiki.apache.org/subversion/FS2/Theory?action=diff&rev1=2&rev2=3

  ''N.B.'': Although the following text uses mathematical concepts and 
notation, it's not intended to be a rigorous dissertation on configuration 
theory. We'll often make statements and draw conclusions without providing 
proof. Therefore, dear reader, you can either trust we're right, or do your own 
homework to prove (or disprove) our assertions. We will, however, try to 
conscientiously flag⚑ all leaps of faith in the text.
  
  '''Definition:''' A ''data configuration'' is a unique pattern of data that 
can be represented as exactly one distinct sequence of binary digits.
-  * The representation of the ''empty configuration'' {} is the zero-length 
sequence.
+  * The representation of the ''empty configuration'' 𝑒 is the zero-length 
sequence.
-  * The ''size'' , │c│, of a configuration c is the length of its 
representative sequence of binary digits.
+  * The ''size'' , ''S'',,c,,, of a configuration c is the length of its 
representative sequence of binary digits.
  
  '''Definition:''' A ''data configuration space'' is a 
[[http://en.wikipedia.org/wiki/Metric_space|metric space]] (𝔹, 𝒹) where:
   * 𝔹 is the set of all data configurations;
@@ -24, +24 @@

  
  applied to the binary-digit sequence representation of data configurations. 
It is easy to show⚑ that 𝓁 has all the required properties of a metric. In 
addition, it has the following properties:
   * The minimum distance between any two distinct configurations is⚑ 1.
-  * The maximum distance between any two distinct configurations is⚑ the 
greater of their sizes: ∀a,b ∈ 𝔹: 𝓁(a, b) ≤ max(│a│, │b│) .
+  * The maximum distance between any two distinct configurations is⚑ the 
greater of their sizes: ∀a,b ∈ 𝔹: 𝓁(a, b) ≤ max(''S'',,a,,, ''S'',,b,,) .
-  * And it follows⚑ from this that: ∀c ∈ 𝔹: 𝓁({}, c) = │c│ .
+  * And it follows from this that: ∀c ∈ 𝔹: 𝓁(𝑒, c) = ''S'',,c,, .