# US 10,373,020 B2 · Computer architecture for emulating an asynchronous correlithm object processing system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 10,373,020 B2
- Document ID: US10373020B2
- Status: Granted
- Kind: B2
- Application number: 16/239,184
- Filed: 2019-01-03
- Published: 2019-05-30
- Granted: 2019-08-06
- Earliest claimed: 2017-11-28
- Assignees: Bank of America Corporation
- Applicants: Bank of America Corporation
- Inventors: Patrick N. Lawrence
- Web page: https://patentgrep.com/patent/US10373020B2

## CPC

- G06N 20/00: Machine learning
- G06F 16/313: {Selection or weighting of terms for indexing}
- G06F 18/10: Pre-processing; Data cleansing
- G06F 18/2111: by using evolutionary computational techniques, e.g. genetic algorithms
- G06F 18/24: Classification techniques
- G06N 3/126: Evolutionary algorithms, e.g. genetic algorithms or genetic programming
- G06N 5/022: Knowledge engineering; Knowledge acquisition
- G06V 10/764: using classification, e.g. of video objects
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING

## Abstract

A device that includes a node engine configured to emulate a first node, a second node, and a third node. The first node is configured to receive a first correlithm object, fetch a second correlithm object based on the first correlithm object, and output the second correlithm object to the second node and the third node. Each correlithm object is a point in an n-dimensional space represented by a binary string. The second node is configured to receive the second correlithm object, fetch a third correlithm object based on the second correlithm object, and output the third correlithm object to the third node. The third node is configured to receive the second correlithm object, receive the third correlithm object, fetch a fourth correlithm object based on the second correlithm object and the third correlithm object, and output the fourth correlithm object.

## Claims

### Claim 1

A device configured to emulate an asynchronous correlithm object processing system, comprising:
a node engine configured to emulate:
a first node linked with a first node table, wherein:
the first node table identifies:
a first plurality of correlithm objects, wherein each correlithm object in the first plurality of correlithm objects is a point in a first n-dimensional space represented by a binary string; and
a second plurality of correlithm objects linked with the first plurality of correlithm objects, wherein each correlithm object in the second plurality of correlithm objects is a point in a second n-dimensional space represented by a binary string; and
the first node is configured to:
receive a first correlithm object;
fetch a second correlithm object from among the second plurality of correlithm objects based on the first correlithm object, wherein fetching the second correlithm object comprises:
determining Hamming distances between the first correlithm object and each of the first plurality of correlithm objects;
identifying a correlithm object with the shortest Hamming distance between the first correlithm object and each of the first plurality of correlithm objects; and
identifying an entry in the first node table that corresponds with the identified correlithm object; and
output the second correlithm object to a second node.

### Claim 2 (depends on 1)

The device of claim 1, wherein determining Hamming distances between the first correlithm object and each of the first plurality of correlithm objects:
performing an XOR operation between the first correlithm object and each of the first plurality of correlithm objects to generate a resulting binary string;
counting the number of logical high values in the resulting binary string; and
identify a correlithm object with the smallest number of logical high values; and
identifying an entry in the first node table that corresponds with the identified correlithm object.

### Claim 3 (depends on 1)

The device of claim 1, wherein the first node is configured to receive the first correlithm object from a sensor configured to convert a real world value into the first correlithm object.

### Claim 4 (depends on 1)

The device of claim 1, wherein the first node is configured to receive the first correlithm object from a node configured to convert a correlithm object into the first correlithm object.

### Claim 5 (depends on 1)

The device of claim 1, wherein the first n-dimensional space and the second n-dimensional space both have the same number of dimensions.

### Claim 6 (depends on 1)

The device of claim 1, wherein the first n-dimensional space has a different number of dimensions than the second n-dimensional space.

### Claim 7 (depends on 1)

The device of claim 1, wherein the first node outputs the second correlithm object to a third node.

### Claim 8

A method for emulating an asynchronous correlithm object processing system, comprising:
receiving, by a first node implemented by a node engine, a first correlithm object;
fetching, by the first node, a second correlithm object from a first node table based on the first correlithm object, wherein the first node table identifies:
a first plurality of correlithm objects, wherein each correlithm object in the first plurality of correlithm objects is a point in a first n-dimensional space represented by a binary string; and
a second plurality of correlithm objects linked with the first plurality of correlithm objects, wherein each correlithm object in the second plurality of correlithm objects is a point in a second n-dimensional space represented by a binary string; and
wherein fetching the second correlithm object comprises:
determining Hamming distances between the first correlithm object and each of the first plurality of correlithm objects;
identifying a correlithm object with the shortest Hamming distance between the first correlithm object and each of the first plurality of correlithm objects; and
identifying an entry in the first node table that corresponds with the identified correlithm object; and
outputting, by the first node, the second correlithm object to a second node implemented by the node engine.

### Claim 9 (depends on 8)

The method of claim 8, wherein determining Hamming distances between the first correlithm object and each of the first plurality of correlithm objects:
performing an XOR operation between the first correlithm object and each of the first plurality of correlithm objects to generate a resulting binary string;
counting the number of logical high values in the resulting binary string; and
identify a correlithm object with the smallest number of logical high values; and
identifying an entry in the first node table that corresponds with the identified correlithm object.

### Claim 10 (depends on 8)

The method of claim 8, further comprising receiving, by the first node, the first correlithm object from a sensor configured to convert a real world value into the first correlithm object.

### Claim 11 (depends on 8)

The method of claim 8, further comprising receiving, by the first node, the first correlithm object from a node configured to convert a correlithm object into the first correlithm object.

### Claim 12 (depends on 8)

The method of claim 8, wherein the first n-dimensional space and the second n-dimensional space both have the same number of dimensions.

### Claim 13 (depends on 8)

The method of claim 8, wherein the first n-dimensional space has a different number of dimensions than the second n-dimensional space.

### Claim 14 (depends on 8)

The method of claim 8, wherein the first node outputs the second correlithm object to a third node.

### Claim 15

A computer program product comprising executable instructions stored in a non-transitory computer readable medium such that when executed by a processor causes the processor to emulate an asynchronous correlithm object processing system configured to:
implement a first node using a node engine;
receive, using the first node, a first correlithm object;
fetch, using the first node, a second correlithm object from a first node table based on the first correlithm object, wherein the first node table identifies:
a first plurality of correlithm objects, wherein each correlithm object in the first plurality of correlithm objects is a point in a first n-dimensional space represented by a binary string; and
a second plurality of correlithm objects linked with the first plurality of correlithm objects, wherein each correlithm object in the second plurality of correlithm objects is a point in a second n-dimensional space represented by a binary string; and
wherein fetching the second correlithm object comprises:
determining Hamming distances between the first correlithm object and each of the first plurality of correlithm objects;
identifying a correlithm object with the shortest Hamming distance between the first correlithm object and each of the first plurality of correlithm objects; and
identifying an entry in the first node table that corresponds with the identified correlithm object; and
output, using the first node, the second correlithm object to a second node.

### Claim 16 (depends on 15)

The computer program product of claim 15, wherein determining Hamming distances between the first correlithm object and each of the first plurality of correlithm objects:
performing an XOR operation between the first correlithm object and each of the first plurality of correlithm objects to generate a resulting binary string;
counting the number of logical high values in the resulting binary string; and
identify a correlithm object with the smallest number of logical high values; and
identifying an entry in the first node table that corresponds with the identified correlithm object.

### Claim 17 (depends on 15)

The computer program product of claim 15, wherein the first node is configured to receive the first correlithm object from a sensor configured to convert a real world value into the first correlithm object.

### Claim 18 (depends on 15)

The computer program product of claim 15, wherein the first node is configured to receive the first correlithm object from a node configured to convert a correlithm object into the first correlithm object.

### Claim 19 (depends on 15)

The computer program product of claim 15, wherein the first n-dimensional space and the second n-dimensional space both have the same number of dimensions.

### Claim 20 (depends on 15)

The computer program product of claim 15, wherein the first n-dimensional space has a different number of dimensions than the second n-dimensional space.
