{"id":118704,"date":"2024-07-31T09:43:10","date_gmt":"2024-07-31T07:43:10","guid":{"rendered":"https:\/\/prohoster.info\/blog\/novosti-interneta\/postroenie-polnoj-po-tyuringu-vychislitelnoj-sredy-pri-pomoshhi-utilit-gnu-find-i-mkdir"},"modified":"2024-07-31T09:43:10","modified_gmt":"2024-07-31T07:43:10","slug":"postroenie-polnoj-po-tyuringu-vychislitelnoj-sredy-pri-pomoshhi-utilit-gnu-find-i-mkdir","status":"publish","type":"post","link":"https:\/\/prohoster.info\/en\/blog\/news\/postroenie-polnoj-po-tyuringu-vychislitelnoj-sredy-pri-pomoshhi-utilit-gnu-find-i-mkdir","title":{"rendered":"Building a Turing-complete computing environment using GNU find and mkdir utilities","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"
Japanese developer Keigo Oka demonstrated that it is possible to create a Turing-complete computational environment using the GNU find and mkdir utilities, allowing for the implementation of any computable function and self-replication. Previously, the possibility of creating such an environment was shown using the sed and awk utilities. To confirm Turing completeness, implementations of the Fizz Buzz game and a cellular automaton operating under 'rule 110' were provided using the combination of find and mkdir. <\/p>\n
To organize loop work with find and mkdir, a trick was used involving the recursive creation of subdirectories, limited by the -maxdepth option (for example, to run a 3-iteration loop, you can execute 'find x -maxdepth 3 -execdir mkdir x\/x ;'). The number of allowable iterations is constrained by the file system limits for creating nested directories and the maximum file path length. Conditional operations are triggered using regular expressions, accessible through the -regex option (for instance, to output the string 'Buzz' for numbers divisible by 5, you can specify '-regex 'd((\/x){5})+' -printf 'Buzz\\n'). \n Source: opennet.ru<\/a> <\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"