Nothing about Turing completeness requires the presence of functions. You're probably looking for a useful language, but you'll have trouble making that criterion rigorous.
All you need is mov (and, technically, a single unconditional branch in each program). You can implement add, subtract, etc. using that.
Perhaps the question you want an answer to is not actually the one you asked? In any case, a programming language does not have to look like ALGOL. Most of the very simple ones do not.