Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Per Martin-Löf

dblp:19/1882 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Information theory · 50% Computational complexity · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory
algorithmic information theory
0.011966
The Definition of Random Sequences · Inf. Control. 1966
Computational complexity › algorithmic randomness
random sequences
0.011966
The Definition of Random Sequences · Inf. Control. 1966

Methods — techniques the papers use, named apart from their topics

measure theory · 0.0computability theory · 0.0
YearPublicationVenuePosition
2006 100 years of Zermelo's axiom of choice: what was the problem with it?
abstract
In February 2005 the Third Annual University of London Kolmogorov Lecture was held at Royal Holloway. These annual lectures were established in 2003. The lecture was given by Professor Per Martin-Löf of Stockholm University—one of the world's foremost researchers in the field of constructive mathematics. Professor Martin-Löf was presented with the Kolmogorov Lecture medal in recognition of his contribution to mathematical logic. Professor Alex Gammerman, Director of Royal Holloway's Computer Learning Research Centre, said: ‘The annual lectures are devoted to Andrei Nikolaevich Kolmogorov (1903–1987) who was one of the foremost Soviet mathematicians of the Twentieth Century. He was active in many mathematical fields, with interests in both theory and application. The work of Kolmogorov is the basis of Complexity Science: he made one of the most beautiful discoveries of the 20th century—what is now known as Kolmogorov Complexity or Algorithmic Information Theory. This discovery is crucial to the great advances currently being made in machine learning, and particularly here at Royal Holloway's world-renowned Computer Learning Research Centre. We have established the annual Kolmogorov Lecture to acknowledge the profound importance of his research. For many years A. N. Kolmogorov was head of the mathematical logic department at Moscow State University, and Per Martin-Löf studied under his supervision in 1964–65’.
Per Martin-Löf
Comput. J.1
1966 The Definition of Random Sequences
Per Martin-Löf
Inf. Control.1