A hierarchical parallel algorithm useful in discovering factorization identities. (English) Zbl 1168.68608
Summary: A hierarchical parallel algorithm is presented, that is useful in discovering identities involving factorizations. The algorithm has principally been applied to Fibonacci-Lucas identities. The algorithm has good modularity, concurrency, scalability and locality and resembles the adaptive systems modeled with Uttley’s informon networks. The algorithm is based on a topology on the space of examples and generalizations that models the process of pattern recognition.
MSC:
68W10 | Parallel algorithms in computer science |
68T05 | Learning and adaptive systems in artificial intelligence |
68T10 | Pattern recognition, speech recognition |
11B37 | Recurrences |
33F10 | Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) |
68W30 | Symbolic computation and algebraic computation |