Jump to navigation Jump to search
- This article is a stub, which means that it is not detailed enough and needs to be expanded. Please help us by adding some more information.
In an answer for this question: In general, for an imperative language to be Turing-complete, it needs:
- A form of conditional repetition or conditional jump (e.g.,
- A way to read and write some form of storage (e.g., variables, tape)