The study of string constraints and symbolic computation encompasses the development of methods and algorithms for analysing and solving problems where variables represent sequences of characters.

In this article we present some of the fundamental principles of a research program—the Sub-Symbolic Paradigm (SSP)—based on a particular approach to unifying connectionist and symbolic computation.

Abstract.The full-rank LDL* decomposition of a polynomial Hermitian matrix is examined. Explicit formulae are given evaluating the coefficients of matrices 𝑙𝑖𝑗 and 𝑑𝑗𝑗. Also, a new method is ...

Don’t get me wrong. Like most people, there’s nothing I enjoy more than solving a long, involved math problem by hand. But, sometimes, a few pages of algebraic scratches on paper is just a means to an ...

These pages provide a showcase of how to use Python to do computations from linear algebra. We will demonstrate both the NumPy (SciPy) and SymPy packages. This is meant to be a companion guide to a ...

Gottfried Leibniz — who died 300 years ago this November — worked on many things. But a theme that recurred throughout his life was the goal of turning human law into an exercise in computation. Of ...