Get the latest tech news
Grappling with Infinity in Constraint Solvers
How can we solve constraint-satisfaction problems that deal with infinite structure? This article is about Sentient, a programming language I wrote to solve tricky problems.
In these cases, it makes sense to start with small representations and progressively rule our search spaces of increasing size. If we run a Sentient program multiple times with different approximations, we can think of this as defining a walk or a path through this multi-dimensional space. Recursive functions could be identified through static analysis and an external program could decide how many calls are allowed for the current instance of the search.
Or read this on Hacker News