I’m currently working on Causality with Deterministic Relationships (Finite Factored Sets put differently and more).
Currently, this is mainly extending the framework to the infinite setting, decidability of finite temporal inference, and efficient finite temporal inference.
Turing completeness regards only the functional behavior of a class of computational systems. I want to look at the internals, what the system is actually doing, and find abstractions in there: Modularity, search processes, and steering mechanisms for instance.
So it’s not about finding yet another framework whose expressiveness is equivalent to Turing completeness. It’s about finding a framework to express the actual computation.