Related papers: A New Version of Algorithmic Information Theory
A survey article for AMS Summer Institute at Seattle in 2005.
This paper is based on four lectures given at the Trieste Summer School 1994 on theories of fermion masses. The first two lectures introduce three mechanisms which have been used to construct models of fermion masses. We then discuss some…
This is an expanded version of the lectures given at the Trieste Summer School 1992 on Low-dimensional Quantum Field Theories for Condensed Matter Physicists.
These are lectures notes for a 4h30 mini-course held in Ulaanbaatar, National University of Mongolia, August 5-7th 2015, at the summer school "Stochastic Processes and Applications". It aims at presenting an introduction to basic results of…
In this position paper, I first describe a new perspective on machine learning (ML) by four basic problems (or levels), namely, "What to learn?", "How to learn?", "What to evaluate?", and "What to adjust?". The paper stresses more on the…
A review of the properties of this alternate basis is presented. To appear in the proceedings of the 3rd Workshop on Thermal Field Theory, Banff, August 1993.
This EPTCS volume collects the post-proceedings of the 10th International Workshop On User Interfaces for Theorem Provers (UITP 2012), held as part of the Conferences on Intelligent Computer Mathematics (CICM 2012) in Bremen on July 11th…
This is the Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence, which was held in Edinburgh, Scotland July 26 - 29 2005.
We present an information-theoretic framework for understanding overfitting and underfitting in machine learning and prove the formal undecidability of determining whether an arbitrary classification algorithm will overfit a dataset.…
We recount problems, questions and conjectures that arose during a problem session of the Third International Conference on Permutation Patterns, University of Florida, March 7-11, 2005.
The first version of these lecture notes is based on the hand-written notes I prepared for the cosmology course taught to graduate students of PPGFis and PPGCosmo at the Federal University of Esp\'irito Santo (UFES), starting in 2014. The…
We develop a statistical mechanical interpretation of algorithmic information theory by introducing the notion of thermodynamic quantities, such as free energy, energy, statistical mechanical entropy, and specific heat, into algorithmic…
In this paper, we describe our decade-long experience of building and operating one of the most active Institutional Repository in the world: www.saber.ula.ve <http://www.saber.ula.ve> (University of the Andes, Merida-Venezuela). In order…
These are notes from a jointly taught class at the University of Chicago and lectures by the first author in Santa Cruz. Topics covered include: construction of moduli spaces of stable maps, Gromov-Witten invariants, quantum cohomology, and…
Honorable Rector, Honorable Professors, and Students of this University: In these times of political and economic struggle and nationalistic fragmentation, it is a particular joy for me to see people assembling here to give their attention…
Age of Information (AoI) is a crucial metric for quantifying information freshness in real-time systems where the sampling rate of data packets is time-varying. Evaluating AoI under such conditions is challenging, as system states become…
Early in 2016, an environmental scan was conducted by the Research Library Data Working Group for three purposes: 1.) Perform a survey of the data management landscape at Los Alamos National Laboratory in order to identify local gaps in…
The 2008 Workshop on Algorithms for Modern Massive Data Sets (MMDS 2008), sponsored by the NSF, DARPA, LinkedIn, and Yahoo!, was held at Stanford University, June 25--28. The goals of MMDS 2008 were (1) to explore novel techniques for…
Some Goedel centenary reflections on whether incompleteness is really serious, and whether mathematics should be done somewhat differently, based on using algorithmic complexity measured in bits of information. [Enriques lecture given…
This document collects the lecture notes from my course "Communication Complexity (for Algorithm Designers),'' taught at Stanford in the winter quarter of 2015. The two primary goals of the course are: 1. Learn several canonical problems…