TURING MASHINASI VA HISOBLASH TO'LIQLIGI KONSEPSIYASINING ZAMONAVIY DASTURLASH TILLARIDA NAMOYISHI
Annotatsiya
Ushbu maqolada Turing mashinasi konsepsiyasi va hisoblash to'liqligi tushunchalarining zamonaviy dasturlash tillarida qanday namoyon bo'lishi nazariy jihatdan tahlil qilingan. Tadqiqotda Alan Turing tomonidan 1936-yilda taqdim etilgan universal hisoblash modeli va uning zamonaviy dasturlash amaliyotidagi ahamiyati ko'rib chiqiladi. Maqolada Turing to'liqligi mezonining Python, Java, C++ va boshqa keng tarqalgan dasturlash tillarida qanday ta'minlanishi adabiyotlar tahlili orqali baholanadi. Asosiy e'tibor nazariy informatika konsepsiyalarining amaliy dasturlashga ko'prik vazifasini bajarishiga qaratilgan.
Kalit soʻzlar:
Iqtiboslar
Turing A.M. On Computable Numbers, with an Application to the Entscheidungsproblem // Proceedings of the London Mathematical Society. – 1936. – Vol. 42. – P. 230-265.
Дэвис М. Вычислимость и неразрешимость. – М.: Мир, 1978. – 232 с.
Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages, and Computation. – Reading: Addison-Wesley, 1979. – 418 p.
Sipser M. Introduction to the Theory of Computation. – 3rd ed. – Boston: Cengage Learning, 2012. – 504 p.
Church A. An Unsolvable Problem of Elementary Number Theory // American Journal of Mathematics. – 1936. – Vol. 58. – No. 2. – P. 345-363.
Sebesta R.W. Concepts of Programming Languages. – 11th ed. – Boston: Pearson, 2015. – 792 p.
Van Rossum G., Drake F.L. The Python Language Reference Manual. – Bristol: Network Theory Ltd., 2011. – 151 p.
Gosling J., Joy B., Steele G., Bracha G. The Java Language Specification. – 3rd ed. – Boston: Addison-Wesley, 2005. – 688 p.
Stroustrup B. The C++ Programming Language. – 4th ed. – Upper Saddle River: Addison-Wesley, 2013. – 1346 p.
Pierce B.C. Types and Programming Languages. – Cambridge: MIT Press, 2002. – 623 p.
Oʻquvchilar geografiyasi
Yuklab olishlar
Nashr qilingan
Son
Boʻlim
Iqtibos keltirish tartibi
