The features used to achieve Turing completeness can be quite different; Fortran systems would use loop constructs or possibly even goto statements to achieve repetition; Haskell and Prolog, lacking looping almost entirely, would use recursion.
أرجوك ، أعطني إشارة أخرىWikiMatrix WikiMatrix