×

Computer architecture for emulating an asynchronous correlithm object processing system

  • US 10,217,026 B1
  • Filed: 05/18/2018
  • Issued: 02/26/2019
  • Est. Priority Date: 11/28/2017
  • Status: Active Grant
First Claim
Patent Images

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 and a third node;

    the second node linked with a second node table, wherein;

    the second node table identifies;

    a third plurality of correlithm objects, wherein each correlithm object in the third plurality of correlithm objects is a point in the second n-dimensional space represented by a binary string; and

    a fourth plurality of correlithm objects linked with the third plurality of correlithm objects, wherein each correlithm object in the fourth plurality of correlithm objects is a point in a third n-dimensional space represented by a binary string; and

    the second node is configured to;

    receive the second correlithm object;

    fetch a third correlithm object from among the fourth plurality of correlithm objects based on the second correlithm object, wherein fetching the third correlithm object comprises;



    determining Hamming distances between the second correlithm object and each of the third plurality of correlithm objects;



    identifying a correlithm object with the shortest Hamming distance between the second correlithm object and each of the third plurality of correlithm objects; and



    identifying an entry in the second node table that corresponds with the identified correlithm object; and

    output the third correlithm object to the third node.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×