Regular Excel formulas are always terminating and therefore not computationally complete.

SQL without recursive CTEs is always terminating and therefore not computationally complete.

Simply typed lambda calculus is always terminating and therefore not computationally complete.

It's not the same, but restriction to terminating subsets gives very nice guarantees for a lot of program properties that would otherwise be undecidable.