Home›Programming language theory›کامل بودن تورینگ🌐فارسیEnglishDeutschEspañolFrançaisItalianoNederlandsPolskiPortuguêsSvenskaРусскийالعربيةفارسیไทย한국어中文日本語EntityQ197970· pop 32· linked from 270 articlesکامل بودن تورینگAlso known as Turing complete, computationally universalability of a computing system to simulate Turing machinesAvailable in 32 languagesEspañolFrançaisDeutsch中文日本語РусскийPortuguêsItalianoالعربيةBulgarianConnectionsTuring machineEntityfunctional programmingEntityCategoriesProgramming language theoryTheory of computationTuring machine