We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Brank
Jump to navigation
Jump to search
- This article 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.,
while,if+goto) - A way to read and write some form of storage (e.g., variables, tape)