Perceiving a finite-state system, Part 2
I had argued that the perception of a finite-state system is different from the perception of a continuous-state system. I had argued that a perception involves a representation, and I pointed out a difference in what was captured in the two kinds of representation (i.e., the representation of a continuous-state system as a continuous-state system by another continuous-state system, versus, the representation of a finite-state system as a finite-state system by another finite-state system). The difference I pointed out was that slight variations that do not constitute changes of state in the finite-state system but do constitute changes of state in the continuous-state system, are captured in the continuous representation, but not in the finite representation.
But that's not the only difference. Finite-state systems are not merely state spaces but have an underlying continuous-state system exhibiting the tendency to cluster. This means that when a represented state falls far from the center of a cluster, then when it is represented, the representing state typically falls closer to the center of the corresponding cluster. The result of this over several generations of copies (copies and copies of copies and copies of copies of copies) is that nth generation finite representations faithfully capture the state of the original, while nth-generation continuous representation are subject to gradual degradation and drift. So while continuous representation but not finite representation captures the continuous state (at least over the short run, subject to drift if too many generations of copies are made), finite representation captures the finite state better than does continuous representation (over the long run).
But I have compared some key benefits and drawbacks of finite versus continuous representation, without actually saying what the difference is between them. I'll do that now, by applying the criterion that I already elaborated earlier (which is to find a point, find a radius d, and so on). So, we apply the criterion to the represented space and to the representing space, and then we consider the combined space, the union of the represented and representing space, and apply the criterion to that, re-using the points and circles that we used in applying the first two criteria.
For example, suppose we have two continuous-state systems that each yield a finite-state system with two states - this means that the underlying continuous systems exhibit two clusters. So, we can define points n1 and n2 in the first system and N1 and N2 in the second system, and a radius d in the first system and a radius D in the second system, such that 99% of the states of the first system fall inside of circles c1 and c2 (defined as centering on n1 and n2 and having radius d), and 99% of the states of the second system fall inside circles C1 and C2 (defined as centering on N1 and N2 and having radius D), and finally, 99% of the combined states [i.e., (x,X) where x is a state in the first system and X is a state in the second system and X was created by the representing mechanism, e.g., by the scribe, in response to x] fall into c1xC1 U c2xC2 (i.e., x is in c1 and X is in C1, or x is in c2 and X is in C2, 99% of the time).
This doesn't really distinguish a scribe from a Xerox machine, provided that the represented state is clear (i.e. is close to the apex of its cluster). However, a scribe has the ability to clarify as he transcribes, something that a Xerox machine does not. This ability to clarify exhibits an awareness (of sorts) of the finite states that the Xerox machine does not have. A scribe may have an internal sense of how clear or unclear his transcription is. This can be implemented as a continuous measure - maybe an alarm, since the point is to get him to strive for clarity - that goes up the further his output gets from the apex of a cluster.
But that's not the only difference. Finite-state systems are not merely state spaces but have an underlying continuous-state system exhibiting the tendency to cluster. This means that when a represented state falls far from the center of a cluster, then when it is represented, the representing state typically falls closer to the center of the corresponding cluster. The result of this over several generations of copies (copies and copies of copies and copies of copies of copies) is that nth generation finite representations faithfully capture the state of the original, while nth-generation continuous representation are subject to gradual degradation and drift. So while continuous representation but not finite representation captures the continuous state (at least over the short run, subject to drift if too many generations of copies are made), finite representation captures the finite state better than does continuous representation (over the long run).
But I have compared some key benefits and drawbacks of finite versus continuous representation, without actually saying what the difference is between them. I'll do that now, by applying the criterion that I already elaborated earlier (which is to find a point, find a radius d, and so on). So, we apply the criterion to the represented space and to the representing space, and then we consider the combined space, the union of the represented and representing space, and apply the criterion to that, re-using the points and circles that we used in applying the first two criteria.
For example, suppose we have two continuous-state systems that each yield a finite-state system with two states - this means that the underlying continuous systems exhibit two clusters. So, we can define points n1 and n2 in the first system and N1 and N2 in the second system, and a radius d in the first system and a radius D in the second system, such that 99% of the states of the first system fall inside of circles c1 and c2 (defined as centering on n1 and n2 and having radius d), and 99% of the states of the second system fall inside circles C1 and C2 (defined as centering on N1 and N2 and having radius D), and finally, 99% of the combined states [i.e., (x,X) where x is a state in the first system and X is a state in the second system and X was created by the representing mechanism, e.g., by the scribe, in response to x] fall into c1xC1 U c2xC2 (i.e., x is in c1 and X is in C1, or x is in c2 and X is in C2, 99% of the time).
This doesn't really distinguish a scribe from a Xerox machine, provided that the represented state is clear (i.e. is close to the apex of its cluster). However, a scribe has the ability to clarify as he transcribes, something that a Xerox machine does not. This ability to clarify exhibits an awareness (of sorts) of the finite states that the Xerox machine does not have. A scribe may have an internal sense of how clear or unclear his transcription is. This can be implemented as a continuous measure - maybe an alarm, since the point is to get him to strive for clarity - that goes up the further his output gets from the apex of a cluster.
