There's no clear value proposition given. What are we sacrificing Turing-completeness in order to gain? For example, one thing a programming language might gain by sacrificing Turing-completeness is that every program provably halts; no infinite loops! This is called "total function programming." There are probably other interesting properties you can gain by sacrificing Turing-completeness as well.
Crema can restrict the computational complexity of the program to the minimum needed to improve security
"Computational complexity" is a technical term that is related to performance, but not security.
Crema can restrict the computational complexity of the program to the minimum needed to improve security
"Computational complexity" is a technical term that is related to performance, but not security.