> I wonder if a language can be Turing-complete without flow control. My guess is no? I agree, unless something like pattern-matching does not count as control

> I wonder if a language can be Turing-complete without flow control. My guess is no? I agree, unless something like pattern-matching does not count as control flow. But then isn't a conditional just a basic pattern? Why does it get a pass?