Related papers: How to Run Algorithmic Information Theory on a Com…
These notes correspond rather accurately to the translation of the lectures given at the Fifth Mexican School of Particles and Fields, held in Guanajuato, Gto., in December~1992. They constitute a brief and elementary introduction to…
We address the problems of estimating the computer efficiency and the computer capacity. We define the computer efficiency and capacity and suggest a method for their estimation, based on the analysis of processor instructions and kinds of…
This is an updated version of my PhD thesis, defended at the University of Waterloo on the 2nd of April 2025, uploaded to the ArXiv with the goal of reaching a wider audience. The thesis is divided into 5 chapters, respectively containing…
Knowledge about programming is part of the knowledge matrix that will be required of the professionals of the future. Based on this, this work aims to report the development of a teaching tool developed during the monitoring program of the…
These notes are based on a lecture course by L. Chekhov held at the University of Manchester in May 2006 and February-March 2007. They are divulgative in character, and instead of containing rigorous mathematical proofs, they illustrate…
Imitation Learning is a promising paradigm for learning complex robot manipulation skills by reproducing behavior from human demonstrations. However, manipulation tasks often contain bottleneck regions that require a sequence of precise…
This proceedings contains abstracts and position papers for the work to be presented at the fourth Logic and Practice of Programming (LPOP) Workshop. The workshop is to be held in Dallas, Texas, USA, and as a hybrid event, on October 13,…
The notion of an individual random sequence goes back to von Mises. We describe the evolution of this notion, especially the use of martingales (suggested by Ville), and the development of algorithmic information theory in 1960s and 1970s…
These are lectures notes for the introductory graduate courses on geometric complexity theory (GCT) in the computer science department, the university of Chicago. Part I consists of the lecture notes for the course given by the first author…
These are notes to accompany four lectures that I gave at the School on Additive Combinatorics, held in Montreal, Quebec between March 30th and April 5th 2006. My aim is to introduce ``quadratic fourier analysis'' in so far as we understand…
This is a transcript of a debate on quantum computing that took place at 6:00pm, Wednesday, 4th June 2003, La Fonda Hotel, Santa Fe, USA. Transcript editor: Derek Abbott. Pro Team: Carlton M. Caves, Daniel Lidar, Howard Brandt, Alex…
In preparation for the 2023 NSAC Long Range Plan (LRP), members of the Nuclear Science community gathered to discuss the current state of, and plans for further leveraging opportunities in, QIST in NP research at the Quantum Information…
In 1686 in his Discours de Metaphysique, Leibniz points out that if an arbitrarily complex theory is permitted then the notion of "theory" becomes vacuous because there is always a theory. This idea is developed in the modern theory of…
These are lecture notes that are based on the lectures from a class I taught on the topic of Spectral Graph Methods at UC Berkeley during the Spring 2015 semester.
This is the written version of lectures presented at "The 17th Symposium on Theoretical Physics - Applied Field Theory", 29 June - 1 July, 1998, the Sangsan Mathematical Science Building, Seoul National University, Seoul, Korea.
After publishing my book "Quantum Computing Architecture and Hardware for Engineers: Step by Step" [1] (now I call it Volume I), in which spin qubit and superconducting qubit quantum computers were covered, I decided to continue to write…
We show that the time evolution of the wave function of a quantum mechanical many particle system can be implemented very efficiently on a quantum computer. The computational cost of such a simulation is comparable to the cost of a…
Lectures at the CRM-CAP Summer School 'Particles and Fields 94' August 16-24 1994, Banff, Alberta, Canada.
Covid has made online teaching and learning acceptable and students, faculty, and industry professionals are all comfortable with this mode. This comfort can be leveraged to offer an online multi-institutional research-level course in an…
Presentation for a talk "Two betting strategies that predict all compressible sequences" given at Seventh International Conference on Computability, Complexity and Randomness (CCR 2012)…