And even simpler is the iota combinator which is by itself turing complete. So a single letter plus matching parens is about the simplest language as you can g

And even simpler is the iota combinator which is by itself turing complete. So a single letter plus matching parens is about the simplest language as you can get. But I can't imagine anyone wanting or even being able to program in it.