Dr. Ahmed G. Abo-Khalil

Electrical Engineering Department

Kolmogorov complex

Kolmogorov complexity

In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity (also known as descriptive complexityKolmogorov–Chaitincomplexityalgorithmic entropy, or program-size complexity) of an object, such as a piece of text, is a measure of the computability resources needed to specify the object. It is named after Andrey Kolmogorov, who first published on the subject in 1963.[1][2]

For example, consider the following two strings of 32 lowercase letters and digits:


Office Hours

Monday 10 -2

Tuesday 10-12

Thursday 11-1

My Timetable


Contacts


email: [email protected]

[email protected]

Phone: 2570

Welcome

Welcome To Faculty of Engineering

Almajmaah University


IEEE


http://www.ieee.org/

/

Links of Interest


http://www.utk.edu/research/

http://science.doe.gov/grants/index.asp

http://www1.eere.energy.gov/vehiclesandfuels/

http://www.eere.energy.gov/


Travel Web Sites

http://www.hotels.com/

http://www.orbitz.com/

http://www.hotwire.com/us/index.jsp

http://www.kayak.com/

Blackboard

ستقام اختبارات الميدتيرم يوم الثلاثاء 26-6-1440

حسب الجدول المعلن بلوحات الاعلان

Summer training

The registration for summer training will start from 5th week of second semester

Academic advising

Class registration week 1

برنامج التجسير




إحصائية الموقع

عدد الصفحات: 2879

البحوث والمحاضرات: 1280

الزيارات: 61031