TL;DR: In this paper, a systematic effort is made to express some of the general results of quantum mechanics in a conceptual form closer to ordinary language than is the case with most modern physics.
Abstract: A systematic effort is here made to express some of the general results of quantum mechanics in a conceptual form closer to ordinary language than is the case with most modern physics. Many of the implications of the theory appear much more clearly thereby, in particular the fact that the laws of quantum mechanics are only statistical propositions about classes, not referring to individual objects. Conversely, the microscopic structure of an object cannot be precisely defined in quantum mechanical terms. To say that an object has a definite microscopic structure is an operationally meaningless statement; it is on the same level as saying in relativity that a selected coordinate system is “at rest.” This raises the need for a “theory of matching”: What is the best statement about the structure of an object, given that the tools of description are only statistical? A technique is known for this: the theory of inductive probabilities. There is no longer one true description but a manifold of statistical descriptions, some of which have a greater likelihood of being satisfactory than others. The main concrete application of this type of conceptual reasoning lies in its power to clean out the speculative underbrush which so far has prevented the transition from theoretical physics to theoretical biology.
TL;DR: In this paper, the problem of determining whether to rename a register assignment statement is solved by deciding whether live ranges of variables of an assignment destination and an assignment source overlap on each other when overlapping does not exist and eliminating an assignment statement.
Abstract: PROBLEM TO BE SOLVED: To reduce a save and recovery code and to improve execution performance of a target code by deciding whether live ranges of variables of an assignment destination and an assignment source overlap on each other, renaming the variables of the assignment destination and source into other variables when overlapping does not exist and eliminating an assignment statement. SOLUTION: Live ranges of separate variables of assignment destination and source of a registered assignment statement decide whether rename is possible. When the live ranges of the assignment destination and source do not overlap on each other except the assignment statement, the rename is possible (S503). When the rename is possible, new reference point information which gathers reference point information of the assignment destination and source is generated. Because the assignment statement is lastly eliminated, reference point information of the assignment statement is eliminated from new reference point information. Next, a new variable information table is generated and generated reference point information is connected to it. Finally, because the assignment statement becomes the assignment statement from the same variable to the same variable and is a meaningless statement, it is eliminated (S504).