Are there theoretical foundations on which Artificial Intelligence can be grounded?
This course on Algorithmic Information will offer you such a theoretical framework.
You will be able to see machine learning, reasoning, mathematics, and even human intelligence as abstract computations aiming at compressing information.
This new power of yours will not only help you understand what AI does (or can’t do!) but also serve as a guide to design AI systems.
What you'll learn
How to measure information through compression
How to compare algorithmic information with Shannon’s information
How to detect languages through joint compression
How to use the Web to compute meaning similarity
How probability and randomness can be defined in purely algorithmic terms
How algorithmic information sets limits to the power of AI (Gödel’s theorem)
A criterion to make optimal hypotheses in learning tasks
A method to solve analogies and detect anomalies
A new understanding of machine learning as a way to achieve compression
Why unexpected means abnormally simple
Why coincidences are unexpected
Why subjective information and interest are due to complexity drop and why relevance, aesthetics, emotional intensity and humour rely on coding.
Syllabus 11
Complexity as code length
Conditional Complexity
Complexity and frequency
Meaning distance
Algorithmic probability, Randomness
Gödel’s theorem
Universal induction - MDL
Analogy & Machine Learning as complexity minimization
University courses you can audit for free, with lectures, readings and practice quizzes.
A verified certificate from the university if you pay for it.
Self-paced: start any time.
A clear syllabus (11 parts) you can see before you start.
Disadvantages
Graded assignments and the certificate need the paid track.
Audit access can expire a few weeks after the course ends.
Learning is free, but the certificate costs money.
Some parts (graded work, certificate) are paid.
Some points apply to every course of this kind; see how we rank.
Free to audit
Free: Choose "Audit this course" when you enrol: lectures, readings and practice are free.
Paid: Graded assignments and the verified certificate (Certificate $59). Audit access may end after the course closes.
Before you start
Examples of what you should know before embarking on this course
what a convex curve looks like,
that log(7^n) is n times log(7)
that rational numbers have finite or periodic expansion,
that rational numbers are countable, but that real numbers are not,
that the probability of "A and B" is the probability of "A knowing B" times the probability of B,
that 65 is 1000001 is in base 2 and 41 in base 16,
how to compute the sum of a finite geometric series,
that {'a':1, 'i':0} is a Python dictionary and why list('ab'*4)[::2] yields ['a','a','a','a'],
that k-means is a clustering method,
what Bayes’…
Instructor: Dennis Freeman, Kendra Pugh This course provides an integrated introduction to electrical engineering and computer science, including modern software engineering, linear systems analysis, electronic circuits, and decision-making. The lecture videos provide an overview of each topic, whi…
Instructor: Neha Narula, Tadge Dryja View the complete course: https://ocw.mit.edu/MAS-S62S18 YouTube Playlist: https://www.youtube.com/playlist?list... This course looks at the design of Bitcoin and other cryptocurrencies and how they function in practice, focusing on cryptography, game theory, an…
This course is a variant of Harvard College's introduction to computer science, CS50, designed especially for business professionals. Whereas CS50 itself takes a bottom-up approach, emphasizing mastery of low-level concepts and implementation details thereof, this course takes a top-down approach,…