Fault tolerant and combinatorial software environment system, method and medium
0 Assignments
0 Petitions
Accused Products
Abstract
A fault tolerant software environment, in which various program components (e.g., portions of computer programs, applications, etc) are objectized into entities represented by “codons.” This allows for improper syntax to occur, enabling, for example, combinatorial operations such as genetic programming. The present invention also contemplates such features as the ability to probabilistically execute individual codons, to switch between treating information as executable code or as data (or passing over it), provides that the individual codons can be tagged so that additional information can be associated with them, and provides for tagging of the stack.
16 Citations
61 Claims
-
1-45. -45. (canceled)
-
46. A computer-based method for processing a plurality of codons, comprising:
-
a. determining whether an expected number and/or type of argument(s) for said one of said codons are available to said one of said codons;
b. where said expected number and/or type of argument(s) are not available, continuing to process said codons by performing one of;
(1) generating randomly said expected number and/or type of argument(s) that are not available, and (2) skipping said one of said codons. - View Dependent Claims (47, 48, 49)
-
-
50. A computer-based method for generating a new construct, comprising:
-
a. combining two or more constructs, or portions thereof, to form the new construct, wherein each of the constructs contains one or more codons; and
b. processing codons in said new construct to determine a result of said new construct, comprising;
(i) obtaining a next codon to be processed from said new construct;
(ii) determining whether an expected number and/or type of argument(s) for said next codon are available to said next codon;
(iii) where said expected number and/or type of argument(s) are not available, continuing processing said codons in said new construct by performing one of;
(1) generating randomly said expected number and/or type of argument(s) that are not available, and (2) skipping said codon of said step (i);
(iv) returning to said step (i) upon determining that there exist additional codons in said new construct to be processed. - View Dependent Claims (51, 52, 53, 54, 55, 56, 57)
-
-
58. A computer-based method for recombining codons within a fault tolerant, recombinatorial computing environment, comprising:
-
a. generating a program comprised of codons;
b. evaluating and/or executing codons in said program, the step (for each codon to be evaluated and/or executed in said program) comprising;
(i) determining whether an expected number and/or type of argument(s) for said are available to said codon being evaluating and/or executing;
(ii) where said expected number of and/or type of argument(s) are available, evaluate/execute said codon to yield the appropriate result; and
(iii) where said expected number of and/or type of argument(s) are not available, continue processing said program by performing one of;
(1) generating randomly said expected number and/or type of argument(s) that are not available, and (2) skipping said codon. - View Dependent Claims (59, 60, 61)
-
Specification