Computer processing and outcome prediction systems and methods

1. A method of decomposing a software code, comprising:

receiving a software algorithm;

creating a source values table and a target values table, the source values table having scaled input-variable attribute values and scaled monotonic processing time values, and the target values table having scaled attribute values and associated time values;

determining a plurality of time-affecting linear pathways (TALPs) of the software algorithm;

determining input dataset attributes that affect a processing time of each of the plurality of TALPs;

determining input dataset attribute values that identify each of the plurality of TALPs;

separating the plurality of TALPs such that each of the plurality of TALPs is individually compilable and executable;

comparing the scaled monotonic processing time values of the source values table to the associated time values of the target values table; and

creating a final polynomial based on the comparison.

2. The method of claim 1 , wherein at least one of the plurality of TALPs includes a loop.

3. The method of claim 1 , wherein at least one of the plurality of TALPs includes a subroutine, method, or module (SMM) call.

4. The method of claim 1 , wherein at least two of the plurality of TALPs are linked together.

5. The method of claim 1 , wherein the comparison includes a binary search process.

6. The method of claim 1 , wherein the target values table includes polynomial terms.

7. A method of determining a quantum code from a time-affecting linear pathway (TALP) parallel component, comprising:

receiving the TALP parallel component;

deconstructing the TALP parallel component into a plurality of TALP splines;

determining one or more input dataset attribute values for the TALP parallel component that varies output dataset attribute values of the TALP parallel component;

splitting the one or more input dataset attribute values into a plurality of monotonic input dataset lists that generate a plurality of monotonic output values;

recombining the plurality of monotonic output values into a set of output values;

calculating a reversible polynomial for each of the plurality of monotonic input dataset lists; and

generating a quantum circuit for each reversible polynomial.

8. The method of claim 7 , further including providing a parallel code generator.

9. The method of claim 7 , further including providing a reversible polynomial generator.

10. The method of claim 7 , further including providing a quantum circuit generator.

11. The method of claim 7 , wherein the TALP splines are reversible.

12. The method of claim 11 , further including creating one or more quantum logic gates.

13. A method of determining time complexity of a software unit, comprising:

receiving a time-affecting linear pathway (TALP);

creating a source values table and a target values table, the source values table having scaled input-variable attribute values and scaled monotonic processing time values, and the target values table having scaled attribute values and associated time values;

determining a plurality of parallel components for the TALP;

receiving a dataset for each of the plurality of parallel components;

determining one or more dataset splits for the dataset of each of the plurality of parallel components and one or more timing values;

calculating a time complexity for each of the plurality of parallel components based on the one or more dataset splits and the one or more timing values;

comparing the scaled monotonic processing time values of the source values table to the associated time values of the target values table; and

creating a final polynomial based on the comparison.