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: a.abokhalil@mu.edu.sa

a_galal@yahoo.com

Phone: 2570

Welcome

Welcome To Faculty of Engineering

Almajmaah University

IEEE

Institute of Electrical and Electronics Engineers

http://www.ieee.org/

http://ieeexplore.ieee.org/Xplore/guesthome.jsp

http://ieee-ies.org/

http://www.ieee-pes.org/

http://www.pels.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/


القران الكريم

http://quran.muslim-web.com/

Travel Web Sites

http://www.hotels.com/

http://www.orbitz.com/

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

http://www.kayak.com/

Photovoltaic Operation


Wave Power

World's Simplest Electric Train



PeltierModule-JouleThief-Fridge

homemade Aircondition

Salt water battery


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

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

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

الزيارات: 41471