Geek Answers Handbook

Can a language be Turing complete without array support?

If a language has control structures and variables, but does not support arrays, lists, memory access and allocation, etc., can it be completed?

Perhaps if there was no limit to the number of variables that you can create, you can simulate arrays, creating a variable type array_1, array_2... array_6000and manually sort through them, and in some way to create complex data structures and recursion?

Edit: even if you cannot access the variables when manipulating names ( array_10+inot allowed)?

+5
source share
2 answers

. Lambda Calculus, Turing, - . , , , - ( ); , , . .

, , , ​​ List, . , , , , , .

, , Turing Complete, , . , SML Haskell, , Lambda Calculus, ! "Turing Complete" - , Turing Computable, . , (, Lambda Calculus).

+17

, ""! - , . , - , , .

, , , :

  • Lisp, .. - , , , - ,
  • , FORTRAN, C "" - , , , , (!) Lisp .

, , - , , , , .

+5

More articles:


All Articles