Leonid A. Levin

American University — United States

Computer Science · Physical Sciences

21h-index7.0kcitations83works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computability, Logic, AI Algorithms(42), semigroups and automata theory(17), Cellular Automata and Applications(13), Cryptography and Data Security(11), Algorithms and Data Compression(10)

Publications83 total

"Pairs and Squares" Periodic Table
arXiv (Cornell University)·2025Open Access
Barons: money, power, and the corruption of the American food industry
The Journal of Peasant Studies·2025
Invited Paper: How Do Humans Succeed in Tasks Like Proving Fermat’s Theorem or Predicting the Higgs Boson?
Lecture notes in computer science·2023
How do humans succeed in tasks like proving Fermat's Theorem or predicting the Higgs boson?
arXiv (Cornell University)·2022Open Access
Set Theory in the Foundation of Math; Internal Classes and External Sets
ArXiv.org·2022Open Access
Gacs – Kucera theorem
Theoretical Computer Science·2022Open Access
Boris Abramovich Trakhtenbrot
Russian Mathematical Surveys·2022
Climbing algorithms (invited talk)
2021Open Access
The Dual Matrix Algorithm for Linear Programming.
arXiv (Cornell University)·2021Open Access
Fundamentals of Computing
arXiv (Cornell University)·2020· 1 citedOpen Access
Assumptions of Randomness in Cosmology Models
ArXiv.org·2017Open Access
Occam bound on lowest complexity of elements
Annals of Pure and Applied Logic·2016· 1 citedOpen Access
Computational Complexity of Functions
arXiv (Cornell University)·2014Open Access
Sets Have Simple Members. (repost).
arXiv (Cornell University)·2014Open Access
Forbidden information
Journal of the ACM·2013· 19 cited
Universal Heuristics: How Do Humans Solve “Unsolvable” Problems?
Lecture notes in computer science·2013· 7 cited
Rarity for Semimeasures
2012· 1 cited
Enumerable Distributions, Randomness, Dependence
arXiv (Cornell University)·2012· 1 citedOpen Access
Turing's Password: What Internet Cannot Leak
2012· 1 cited
On Sets of High Complexity Strings
2011· 6 cited
page 1 of 5Next →

Frequent Co-authors

Russell Impagliazzo(3), Oded Goldreich(3), Bruno Durand(3), Alexander Shen(3), Michael Luby(2), Gene Itkis(2), Jeffrey Considine(2), David Metcalf(2), Samuel Epstein(2), Péter Gács(2), Johan Håstad(1), Alexander K. Zvonkin(1), László Babai(1), Lance Fortnow(1), Márió Szegedy(1), Shafi Goldwasser(1), R. Venkatesan(1), David Zuckerman(1), Ramarathnam Venkatesan(1), Matthias Fitzi(1)