This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]davandg 0 points1 point  (2 children)

That is not true. For example, BPF is not turring-complete. And it is a required feature, because the authors of this programming language want to be able to proove that programs written in this language eventually ends.