Abstract: A system for checking natural language in proof models of modal logic includes parsing natural language for parts of speech mapping (POSM) into logical symbols and expressions, then proving the logical expression in the logic model checker (LCM) by modal logic. The LCM is applied to computer program validation and requirement document verification.

Abstract: A system for prediction of statistical time series includes Kanban cells (KC), Kanban cell neurons (KCN), and Kanban neuron models (KNM). The KNM as applied may be used for predicting time series of financial marketplaces and of natural phenomena.

Abstract: A system for machine cognition includes Kanban cells (KC), Kanban cell neurons (KCN), and Kanban cell neuron networks (KCNN). The KC is an asynchronous AND-OR gate without feedback that is self-timing by the input data to process until input is equal to output. Input is a four-valued logic (4VL) based on the set {contradiction, true, false, tautology} of four-valued bit code (4vbc) where contradiction is equivalent to null. Access to a sparsely filled look up table (LUT) is minimized in hardware with a 2-bit value per logical signal.

Abstract: A system for machine cognition includes Kanban cells (KC), Kanban cell neurons (KCN), and Kanban cell neuron networks (KCNN). The KC is an asynchronous AND-OR gate without feedback that is self-timing by the input data to process until input is equal to output. Input is a four-valued logic (4 VL) based on the set {contradiction, true, false, tautology} of four-valued bit code (4 vbc) where contradiction is equivalent to null. Access to a sparsely filled look up table (LUT) is minimized in hardware with a 2-bit value per logical signal.

Abstract: The binary sort access method and apparatus makes use of a binary search to show where an item of data not found should be placed in sorted order within a list in a table in memory or in a file on a storage device. The method includes building the list structure when items of data are inserted in and maintained in sorted order in a table in memory or in a file on a storage device. When no blank table entry is available items of data are moved to make room for the next succeeding item of data. A partially filled or filled list of items may be rewritten again to provide one or more blank table entries between each item of data.

Abstract: A random number generator is shown with a two phase operation, the two phases operating to increase the measured randomness of the numbers generated at very little additional cost. The first phase of operation uses conventional techniques to generate an intermediate random number. This intermediate random number is then used by the second phase to generate two potential final random numbers. One of these is picked to be the resultant random number based on whether a specified bit of the intermediate random number is set.