Any-To-Any System For Doing Computing

Abstract

Methods for constructing an Any-to-Any data machine (consisting of Any-to-Any data components and their environmental requirements) and an Any-to-Any code machine (consisting of Any-to-Any code components and their environmental requirements) and relating them together so that they harmoniously interact and so that the data Any-to-Any machine controls and is also acted upon by the code Any-to-Any machine so as to produce an Any-to-Any system that transforms data in a manner that is useful and which is analogous to the harmonious interaction of the Any-Any binary code and Any-to-Any transistor systems, and which handles data and transforms it in a sufficiently similar manner to the manner in which the human handles and transforms data that the human finds it easy and intuitive to operate, all supported by methods that enable data to be stored in a single logical grid structure that can accept and correctly relate, transmit and receive any data, together examples of methods to derive benefits from these inventions.

1 .- 45 . (canceled) 
     
     
         46 . A method for constructing executable instructions from a set of code units accessible to a processor in a computing-capable host, comprising:
 storing, in a memory element coupled to the processor, a set of unique code units, each member of the set of unique code units identifying a single action to be performed by the processor, each single action in the set of unique code units representative of a separately controllable item, wherein each unique code unit is separately identifiable and accessible;   using an indexing module operative on the computing-capable host to associate a reference with each unique code unit to generate a set of associations;   receiving, via a communications portal, indicia of a desired action to be performed on data accessible by the processor;   using a generator module to identify an association between a first member of the set of code units with a second member of the code units such that the first member and the second member of the set of code units when assembled and communicated via the communications portal to an operating system and executed by the processor will result in the desired action;   generating an assembly using a reference associated with the first member of the set of code units and a reference associated with the second member of the set of code units, the assembly including identified code units;   storing, in the memory element coupled to the processor, the assembly; and   associating an assembly reference with the stored assembly.   
     
     
         47 . The method of  claim 46 , wherein execution of the stored assembly results in an input/output operation on the computing-capable host. 
     
     
         48 . The method of  claim 47 , wherein the input/output operation is selected from the group consisting of a data manipulation and a code manipulation. 
     
     
         49 . The method of  claim 48 , wherein the code manipulation includes generating an additional assembly. 
     
     
         50 . The method of  claim 46 , wherein storing the assembly is accomplished directly or indirectly. 
     
     
         51 . The method of  claim 46 , wherein any number of code units can be used with any number of code units in a manner that is not intrinsically hierarchical and is intrinsically unlimited. 
     
     
         52 . The method of  claim 46 , wherein the data accessible by the processor is representative of a graphical element. 
     
     
         53 . The method of  claim 52 , wherein the data is representative of a separately identifiable parameter of the graphical element. 
     
     
         54 . The method of  claim 53 , wherein the data is stored separately in the memory element. 
     
     
         55 . The method of  claim 54 , further comprising:
 using assemblies constructed from the code units and the stored data to manipulate graphics with the computing-capable host.   
     
     
         56 . The method of  claim 46 , wherein the data accessible by the processor is representative of a word of a human language. 
     
     
         57 . The method of  claim 56 , wherein the data is a separately identifiable spelling of the word. 
     
     
         58 . The method of  claim 57 , wherein the data is a separate meaning of the word. 
     
     
         59 . The method of  claim 57 , further comprising:
 saving a rule in the memory element.   
     
     
         60 . The method of  claim 59 , further comprising:
 applying the rule to decision module to determine when a particular meaning of a word is applicable.   
     
     
         61 . The method of  claim 60 , further comprising:
 applying a condition to detect when a particular meaning of a word is applicable.   
     
     
         62 . The method of  claim 61 , further comprising:
 using phrases constructed from a set of two or more words to manipulate data with the computing-capable host.   
     
     
         63 . The method of  claim 62 , further comprising:
 using a command matcher to identify a reference and replace the reference with a referenced item.   
     
     
         64 . The method of  claim 46 , wherein the memory element includes a portion allocated to store a data storage system accessible by the computing-enabled host for use as a data relation table (DRT) in which a cell is used to store data or code units, wherein:
 the DRT is divided into data categories comprising:
 administrative data for administrating the data storage system, 
 life data, 
 time data, 
 spatial data, 
 energy data, and 
 matter data; 
   data to be stored and code are divided into one or more data categories according to meaning in the case of data and according to function in the case of code, to populate the DRT on a computer readable storage media,   queries for querying the DRT are stored in a DRT record-like format on the computer readable storage media.   
     
     
         65 . The method of  claim 64 , wherein a computing-capable host is enabled to compute on the basis of differences, identities and degrees of similarity in data recorded on computer readable media by:
 code which designates and treats stored data as being identical to the data of a query, when all the terms of the data in the query on a query-by-example (QBE) basis are exactly matched by all of the data terms of a record in the DRT and,   which designates and treats data as being different to the data of a query, when none of the terms of the data in the query are exactly matched by any of the terms of a record in the DRT and,   code which is able to effectively remove different individual terms and combinations of terms from the data of a query or that is capable of determining exactly which terms in a query are found in records where at least one term in the query and one term in a record in the DRT are found to match one another exactly when queried on a QBE basis and then further:   designating and treating the data found as being similar to the data of a query where at least one of the terms of a query used to query the DRT on a QBE basis are exactly matched by at least one of the terms of a record in the DRT,   designating and treating the degree of similarity of matched records to the data in the query as being the proportion of the values in the query that are exactly matched by individual values in the matched records, or designating and treating the degree of similarity of the matched records to the data of the query as being the proportion of the values in each of the matched records that exactly match the individual data values in the query.