I doubt it'll be Turing-complete, like Ethereum's, as that's likely overkill/window dressing.
I'm drinking wine and haven't looked into Ethereum at all, so please excuse me if I'm being ignorant, but even NAND gates and Rule #110 Wolfram Cellular Automaton are Turing complete, no? The complexity required for universal computation is surprisingly low.