3-Mavzu: Axborot kompyuter texnologiyalarini tadbiq qilishning texnik vositalari reja

Kompyuterning ishlash printsipi va tashkil etuvchilari
Kompyuterning ishlash printsipini birinchi ingliz olimi Charliz Bebich va uning g`oyasining mukammalshgan ko`rinishini Djon Fon Neyman taklif qilgan. Uning printsipi dastur asosida boshqariladigan avtomatik ravishda ketma – ket ishlash g`oyasidan iborat. Hozirda ko`p rusumli kompyuterlar shu g`oya asosida ishlaydi. Lekin keyingi paytlarda ko`p protsessorli kompyuterlar, ya’ni bir vaqtda dasturning bo`laklarini ketma – ket emas, parallel bajaradigan kompyuterlar ham yaratilganligini ko`rsatib o`tish joizdir. Shunday qilib, kompyuter avvaldan tuzilgan dastur asosida ishlaydi. O`z navbatida, dastur qo`yilgan masalani kompyuterda yechish uchun qandaydir dasturlash tilida yozilgan buyruqlar (operatorlar) ketma –ketligidir. Dasturlash tilida tuzilgan dasturlar maxsus tarjimon dasturlar yordamida kompyuterlar tiliga o`tkaziladi. Kompyuter tili 0 va 1 lardan tashkil topgan, ma’lum qoidalar asosida yoziladigan ketma – ketliklardan iborat. Fon Neyman printsipi bo`yicha avtomatik ravishda bajariladigan dastur avval kompyuterning xotirasiga yuklanadi. Xotirada turgan dastur asosida dasturni tashkil etuvchi har bir operator ishni ketma – ket bajaradi.


The concept of modern computer

The principle of the modern computer was proposed by Alan Turing, in his seminal 1936 paper,[3 On Computable Numbers. Turing proposed a simple device that he called "Universal Computing machine" that is later known as a Universal Turing machine. He proved that such machine is capable of computing anything that is computable by executing instructions (program) stored on tape, allowing the machine to be programmable.

The fundamental concept of Turing's design is stored program, where all instruction for computing is stored in the memory.

Von Neumann acknowledged that the central concept of the modern computer was due to this paper.[35] Turing machines are to this day a central object of study in theory of computation. Except for the limitations imposed by their finite memory stores, modern computers are said to be Turing-complete, which is to say, they have algorithm execution capability equivalent to a universal Turing machine.

*(3.Discovering Computers 2016. Tools, Apps, Devices,and the Impact of Texnology. 55 pg.)