AFAPBP: Aggregate Function Accelerated Parallel Bit-Pattern Computing

Classical computing models have proven sufficient for problems of the complexity class ``P", but problems of a higher complexity class like ``NP", ``NP-Hard", etc. have been shown to be more resistant to efficient computation. Quantum Computing is an alternative computing model that specifically targets performing computations within the ``NP" complexity class in close to linear time. However, Quantum Computing has its own set of problems. Methods for dealing with quantum decoherence, error correction, and difficulty in scaling have all inhibited Quantum Computing from becoming a commonly used computational model. This thesis introduces AFAPBP (Aggregate Function Accelerated Parallel Bit Pattern), a parallel computing model where each Processing Element within the network uses a quantum-inspired computing model that performs quantum-like algorithms on conventional hardware. The Processing Elements are tied together via a network fabric called the AFAPI (Aggregate Function Application Programming Interface), which is a bit-serial SIMD-style network where the Processing Elements are the computers within the network.