Mavzu: Algoritmlarni loyixalashga kirish. Algoritmlarni vaqt va xajm bo’yicha baxolash. Ko’pxadlar qiymatlarini xisoblashda Gorner sxemasi

Nazorat savollari

1. 
   Algoritm nima?
   
2. 
   Algoritmning matnli usuli qachon foydalaniladi?
   
3. 
   Takrorlanuvchi va tarmoqlanuvchi algoritmlarni qandayfarqi bor?
   
4. 
   Matritsalar nima?
   

Foydalanilgan adabiyotlar

1. 
   Boolos, George; Jeffrey, Richard (1999) [1974]. Computability and Logic (4th ed.). Cambridge University Press, London. ISBN 978-0-521-20402-6.: cf. Chapter 3 Turing machines where they discuss "certain enumerable sets not effectively (mechanically) enumerable".
   
2. 
   Burgin, Mark (2004). Super-Recursive Algorithms. Springer. ISBN 978-0-387-95569-8.
   
3. 
   Campagnolo, M.L., Moore, C., and Costa, J.F. (2000) An analog characterization of the subrecursive functions. In Proc. of the 4th Conference on Real Numbers and Computers, Odense University, pp. 91–109