Cover Image

Multiplicative Turing Ensembles, Pareto's Law, and Creativity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kolpakov, Alexander, Rocke, Aidan
Format:	Preprint
Published:	2025
Subjects:	Information Theory Computational Complexity Mathematical Physics H.1.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Benford's Law from Turing Ensembles and Integer Partitions
by: Kolpakov, Alexander, et al.
Published: (2025)

Lagrangians, Renormalization, and Quantization in Prefix Coding
by: Kolpakov, Alexander, et al.
Published: (2025)

On the impossibility of discovering a formula for primes using AI
by: Kolpakov, Alexander, et al.
Published: (2023)

On the Complexity of the Conditional Independence Implication Problem With Bounded Cardinalities
by: Makowski, Michał
Published: (2024)

Machine Learning of the Prime Distribution
by: Kolpakov, Alexander, et al.
Published: (2024)

The Information Geometry of UMAP
by: Kolpakov, Alexander, et al.
Published: (2023)

Improved Constructions of Skew-Tolerant Gray Codes
by: Himelfarb, Gabriel Sac, et al.
Published: (2024)

Burau representation, Squier's form, and non-Abelian anyons
by: Kolpakov, Alexander
Published: (2025)

Dimensionality reduction for homological stability and global structure preservation
by: Kolpakov, Alexander, et al.
Published: (2025)

Ranking by Momentum based on Pareto ordering of entities
by: Imielinski, Tomasz
Published: (2021)

Maximally Extendable Sheaf Codes
by: Panteleev, Pavel, et al.
Published: (2024)

Tight bounds on depth-2 QAC-circuits computing parity
by: Fenner, Stephen, et al.
Published: (2025)

New Construction of Locally q-ary Sequential Recoverable Codes: Parity-check Matrix Approach
by: Baghban, Akram, et al.
Published: (2025)

Optimizing the Decoding Probability and Coverage Ratio of Composite DNA
by: Cohen, Tomer, et al.
Published: (2025)

Towards a Theory of Pragmatic Information
by: Weinberger, Edward D.
Published: (2024)

M-DAB: An Input-Distribution Optimization Algorithm for Composite DNA Storage by the Multinomial Channel
by: Kobovich, Adir, et al.
Published: (2023)

Poincaré Duality and Multiplicative Structures on Quantum Codes
by: Li, Yiming, et al.
Published: (2025)

Composition Theorems for Multiple Differential Privacy Constraints
by: Cadir, Cemre, et al.
Published: (2026)

All Kolmogorov complexity functions are optimal, but are some more optimal?
by: Bauwens, Bruno, et al.
Published: (2025)

Timely NextG Communications with Decoy Assistance against Deep Learning-based Jamming
by: Costa, Maice, et al.
Published: (2024)

An information-theoretic proof of the Erdős-Kac theorem
by: Rocke, Aidan
Published: (2022)

A Tsallis-Entropy Lens on Genetic Variation
by: Geleta, Margarita, et al.
Published: (2025)

Algorithmizing the Multiplicity Schwartz-Zippel Lemma
by: Bhandari, Siddharth, et al.
Published: (2021)

Huygens-Fresnel Model Based Position-Aided Phase Configuration for 1-Bit RIS Assisted Wireless Communication
by: Zheng, Xiao, et al.
Published: (2024)

Extremal Mechanisms for Pointwise Maximal Leakage
by: Grosse, Leonhard, et al.
Published: (2023)

Unitary designs in nearly optimal depth
by: Cui, Laura, et al.
Published: (2025)

Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations
by: Onah, Chinonso, et al.
Published: (2026)

Equivalence of Informations Characterizes Bregman Divergences
by: Chodrow, Philip S.
Published: (2025)

Empirical coordination in the finite blocklength regime: an achievability result---Extended version
by: Massicot, Olivier, et al.
Published: (2026)

Catalytic Computing and Register Programs Beyond Log-Depth
by: Alekseev, Yaroslav, et al.
Published: (2025)

Amortized Locally Decodable Codes
by: Blocki, Jeremiah, et al.
Published: (2025)

Timeliness in NextG Spectrum Sharing under Jamming Attacks with Deep Learning
by: Costa, Maice, et al.
Published: (2024)

A Model-Driven Lossless Compression Algorithm Resistant to Mismatch
by: Hu, Cordelia, et al.
Published: (2026)

Binary cyclic codes from permutation polynomials over $\mathbb{F}_{2^m}$
by: Bose, Mrinal Kanti, et al.
Published: (2025)

An information-theoretic upper bound on prime gaps
by: Rocke, Aidan
Published: (2021)

All the information in the integers is in the primes
by: Rocke, Aidan
Published: (2021)

A polynomial-time classical algorithm for noisy quantum circuits
by: Schuster, Thomas, et al.
Published: (2024)

A learning theory for quantum photonic processors and beyond
by: Rosati, Matteo
Published: (2022)

The Rate-Immediacy Barrier in Explicit Tree Code Constructions
by: Cohen, Gil, et al.
Published: (2025)

Phase-Only Zero-Forcing for Secure Wireless Communication in Multi-User Systems
by: Hong, Jordan, et al.
Published: (2025)