Groups keyboard shortcuts have been updated

Dismiss

See shortcuts

Algorithmic Information Theory

Contact owners and managers

1–30 of 63

Welcome to the Algorithmic Information Theory group!

The Algorithmic Information Theory (AIT) group is a moderated mailing list intended for people interested in

Kolmogorov Complexity and

Solomonoff Induction, and more broadly in

Information Theory,

Theoretical Computer Science,

Mathematical Statistics,

Recursion Theory,

and other areas or disciplines related to AIT.

The mailing list is actually 20+ years old, but I moved it from

https://mailman2.ti-edu.ch/mailman/listinfo/kolmogorov

to Google Groups in April 2019.

See http://www.hutter1.net/ait.htm for more information.

Also, after moderating it for 17 year I'm looking for someone who could take over before it dies due to my lack of attention,

and possibly even revive it to a more active discussion platform as it has been (a very) long time ago.

If you have any ideas or questions or comments, please post them!

In any case, I welcome you to the reborn group.

Kind regards,

Marcus Hutter

http://www.hutter1.net/ait.htm

0 selected

Aram Ebtekar

12/3/24

Thermodynamic entropy = Kolmogorov complexity

Hi all, I'd like to announce an upcoming Physical Review E article in collaboration with Marcus

unread,

Thermodynamic entropy = Kolmogorov complexity

Hi all, I'd like to announce an upcoming Physical Review E article in collaboration with Marcus

12/3/24

tsteifer

10/3/24

CfA: 2 research positions in theoretical computer science, logic and artificial intelligence, Warsaw (Poland)

Dear all, I can currently offer up to 2 research positions at the Institute of Fundamental

unread,

CfA: 2 research positions in theoretical computer science, logic and artificial intelligence, Warsaw (Poland)

Dear all, I can currently offer up to 2 research positions at the Institute of Fundamental

10/3/24

Gabriel Leuenberger, … Ming Li6

7/10/24

Occam's razor justification, missing page number

Dear Gabriel, I am not sure what the argument is. But if it favors a few "complex"

unread,

Occam's razor justification, missing page number

Dear Gabriel, I am not sure what the argument is. But if it favors a few "complex"

7/10/24

Marcus Hutter

5/6/24

Special Issue on "New Horizons at the Intersections of Machine Learning, Dynamical Systems, and Algorithmic Information Theory" in Physica D

We are pleased to announce an upcoming special issue in Physica D: Nonlinear Phenomena, dedicated to

unread,

Special Issue on "New Horizons at the Intersections of Machine Learning, Dynamical Systems, and Algorithmic Information Theory" in Physica D

We are pleased to announce an upcoming special issue in Physica D: Nonlinear Phenomena, dedicated to

5/6/24

Jean-Louis Dessalles

4/25/24

[AIT] MOOC on Algorithmic Information & AI

Hi everyone, The MOOC on Algorithmic Information & AI is back online on EdX. The current session

unread,

[AIT] MOOC on Algorithmic Information & AI

Hi everyone, The MOOC on Algorithmic Information & AI is back online on EdX. The current session

4/25/24

Gabriel Leuenberger, … john.tromp7

4/22/24

Relaxing Levin's Coding Theorem

Thank you very much for all this useful information, John Tromp. Meanwhile, I have obtained a result

unread,

Relaxing Levin's Coding Theorem

Thank you very much for all this useful information, John Tromp. Meanwhile, I have obtained a result

4/22/24

jabowery, … Cole Wyeth9

4/20/24

NiNOR Complexity

In defense of "AIC", and with acute awareness that Akaike Information Criterion has not

unread,

NiNOR Complexity

In defense of "AIC", and with acute awareness that Akaike Information Criterion has not

4/20/24

Ravi Deedwania, … Bruno Bauwens6

2/3/24

Information Distance Questions

Thank you! On Fri, Feb 2, 2024 at 6:30 AM Bruno Bauwens <brba...@gmail.com> wrote: There were

unread,

Information Distance Questions

Thank you! On Fri, Feb 2, 2024 at 6:30 AM Bruno Bauwens <brba...@gmail.com> wrote: There were

2/3/24

Nelma Moreira

11/27/23

DCFS 2024 - Call for papers

We apologise for multiple copies. ================================================= First Call for

unread,

DCFS 2024 - Call for papers

We apologise for multiple copies. ================================================= First Call for

11/27/23

Kreinovich, Vladik, … Aram Ebtekar5

6/21/23

RE: CCR 2023: Call for participation

Thanks Tomasz. Seems a lot of people were had by the scam; it's even on Marcus' page under

unread,

RE: CCR 2023: Call for participation

Thanks Tomasz. Seems a lot of people were had by the scam; it's even on Marcus' page under

6/21/23

Universal Simplexity

5/30/23

Applying Algorithmic Generative Modelling to the problem of causal factor discovery in stock returns

Hi all, I am interested to find out if I have some how missed any papers performing the above-

unread,

Applying Algorithmic Generative Modelling to the problem of causal factor discovery in stock returns

Hi all, I am interested to find out if I have some how missed any papers performing the above-

5/30/23

Marcus Hutter

4/19/23

Special issue on AIT and Machine Learning

Dear all, Just a quick note that the special issue in Physica D on AIT & ML is still open, and

unread,

Special issue on AIT and Machine Learning

Dear all, Just a quick note that the special issue in Physica D on AIT & ML is still open, and

4/19/23

Wolfgang Merkle

3/13/23

Computability, Complexity and Randomness 2023: Call for submissions

Computability, Complexity and Randomness 2023: Call for submissions The 16th International Conference

unread,

Computability, Complexity and Randomness 2023: Call for submissions

Computability, Complexity and Randomness 2023: Call for submissions The 16th International Conference

3/13/23

Aram Ebtekar, … jabowery12

3/8/23

Hutter's decision-theoretic argument for Solomonoff induction

Oops I replied on the Google thread but forgot to change back the subject line. I think Jim Bowery

unread,

Hutter's decision-theoretic argument for Solomonoff induction

Oops I replied on the Google thread but forgot to change back the subject line. I think Jim Bowery

3/8/23

fryolysis

3/7/23

Hutter's strong confidence in a computable universe

In his "A complete theory of everything" paper, he made the assumption that the universe (

unread,

Hutter's strong confidence in a computable universe

In his "A complete theory of everything" paper, he made the assumption that the universe (

3/7/23

Universal Simplexity

3/7/23

Peer-reviewed papers on the application of AIT in Finance ???

Hi, Can anyone help me with this paper that I have been trying to locate for days? "Econophysics

unread,

Peer-reviewed papers on the application of AIT in Finance ???

Hi, Can anyone help me with this paper that I have been trying to locate for days? "Econophysics

3/7/23

Kreinovich, Vladik

1/27/23

FW: CiE 2023: FINAL CALL FOR PAPERS

FYI CiE 2023: FINAL CALL FOR PAPERS Computability in Europe 2023 Unity of Logic and Computation

unread,

FW: CiE 2023: FINAL CALL FOR PAPERS

FYI CiE 2023: FINAL CALL FOR PAPERS Computability in Europe 2023 Unity of Logic and Computation

1/27/23

Aidan Rocke

10/16/22

Kolmogorov Axioms for Algorithmic Probability

As I don't read/write in Russian, the following MathOverflow question may be of interest to the

unread,

Kolmogorov Axioms for Algorithmic Probability

As I don't read/write in Russian, the following MathOverflow question may be of interest to the

10/16/22

Kamaludin Dingle

7/21/22

Special issue on AIT and machine learning

Dear all, Following our conference on AIT and machine learning, we have a special issues in Physica D

unread,

Special issue on AIT and machine learning

Dear all, Following our conference on AIT and machine learning, we have a special issues in Physica D

7/21/22

Cole Wyeth, Kamaludin Dingle2

7/21/22

Seeking PhD Positions in AIT

Hello, You might want to contact Prof Ard Louis in Oxford Theoretical Physics. Funding might be an

unread,

Seeking PhD Positions in AIT

Hello, You might want to contact Prof Ard Louis in Oxford Theoretical Physics. Funding might be an

7/21/22

Jean-Louis Dessalles

7/7/22

MOOC on Algorithmic Information & AI

Dear colleagues, The MOOC "AIAI" offers a gentle introduction to Algorithmic Information

unread,

MOOC on Algorithmic Information & AI

Dear colleagues, The MOOC "AIAI" offers a gentle introduction to Algorithmic Information

7/7/22

JOSE ANTONIO MARTIN HERNANDEZ, … Marcus Hutter4

5/7/22

Undecidability of determining if a pattern exists in a dataset [Proof request or work on it]

Symposium on Algorithmic Information Theory and Machine Learning, 4 -5 July 2022, Alan Turing

unread,

Undecidability of determining if a pattern exists in a dataset [Proof request or work on it]

Symposium on Algorithmic Information Theory and Machine Learning, 4 -5 July 2022, Alan Turing

5/7/22

Kreinovich, Vladik

8/17/21

FW: LFCS second call for papers

FYI, computability and randomness is one of the highlighted topics From: robertl...@att.net Sent:

unread,

FW: LFCS second call for papers

FYI, computability and randomness is one of the highlighted topics From: robertl...@att.net Sent:

8/17/21

Aidan Rocke, John Tromp3

8/13/21

Chaitin's incompleteness theorem

Good afternoon AIT mailing list, I wrote imprecisely when I said that there are finitely many

unread,

Chaitin's incompleteness theorem

Good afternoon AIT mailing list, I wrote imprecisely when I said that there are finitely many

8/13/21

Kreinovich, Vladik, Paul Vitanyi2

8/12/21

RE: Asymptotic growth of a non-computable sequence

----- Forwarded Message ----- From: Paul Vitanyi <pa...@cwi.nl> To: Kreinovich, Vladik <

unread,

RE: Asymptotic growth of a non-computable sequence

----- Forwarded Message ----- From: Paul Vitanyi <pa...@cwi.nl> To: Kreinovich, Vladik <

8/12/21

Aidan Rocke, JOSE ANTONIO MARTIN HERNANDEZ7

6/26/21

AIT machine learning challenge

Hello Aidan, I'm afraid that the theoretical problem of P vs. NP is not solved so we can't

unread,

AIT machine learning challenge

Hello Aidan, I'm afraid that the theoretical problem of P vs. NP is not solved so we can't

6/26/21

Jean-Louis Dessalles

6/23/21

Announcing a MOOC on Algorithmic Information

After a long period of preparation, we are proud to announce the imminent availability of a MOOC on

unread,

Announcing a MOOC on Algorithmic Information

After a long period of preparation, we are proud to announce the imminent availability of a MOOC on

6/23/21

Nelma Moreira

4/6/21

DLT 2021 *Extended Deadline: April 23*

We apologize for multiple copies. ================================================= Final Call for

unread,

DLT 2021 *Extended Deadline: April 23*

We apologize for multiple copies. ================================================= Final Call for

4/6/21

Nelma Moreira

2/21/21

DLT 2021 - 2nd CFP

We apologize for multiple copies. ================================================= Second Call for

unread,

DLT 2021 - 2nd CFP

We apologize for multiple copies. ================================================= Second Call for

2/21/21

Kreinovich, Vladik, … Paul Vitanyi3

1/23/21

FW: sad news

Let me join in saying "sad loss". Alan was always very friendly and inspiring. Paul -----

unread,

FW: sad news

Let me join in saying "sad loss". Alan was always very friendly and inspiring. Paul -----

1/23/21