The discussion revolves around factoring algorithms, specifically those that operate at exponential speed. Participants are exploring comparisons between different algorithms and their efficiencies, particularly in the context of factoring large numbers.
The discussion contains multiple competing views regarding the efficiency and classification of factoring algorithms. There is no consensus on the definitions or the effectiveness of the proposed exponential approaches compared to existing algorithms.
Participants have not fully defined their terms, such as "reducing beyond the root exponentially," and there are unresolved questions about the assumptions underlying the comparisons being made.
Better than existing algorithms? Those are way below exponential time...For very large numbers this greatly reduces time and makes factoring of large numbers possible within a useful period of time.