Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács

DOI10.1016/J.TCS.2023.113776zbMATH Open1506.68004OpenAlexW4321446200MaRDI QIDQ2686112FDOQ2686112

Authors:

Publication date: 24 February 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113776

Recommendations

• scientific article; zbMATH DE number 53549
• scientific article; zbMATH DE number 809134
• Computability, algorithmic randomness and complexity
• Preface: Special issue in honor of the 60th birthday of Prof. Gad M. Landau
• Randomness, computation and mathematics

Mathematics Subject Classification ID

Festschriften (00B30) Biographies, obituaries, personalia, bibliographies (01A70) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Theory of computing (68Qxx)

Cites Work

• Khachiyan’s algorithm for linear programming
• Information distance
• Algorithmic tests and randomness with respect to a class of measures
• Title not available (Why is that?)
• Algorithmic statistics
• Randomness on computable probability spaces -- a dynamical point of view
• On the relation between descriptional complexity and algorithmic probability
• Title not available (Why is that?)
• Uniform test of algorithmic randomness over a general space
• Title not available (Why is that?)
• Lower bounds for the complexity of reliable Boolean circuits with noisy gates
• A Turing machine resisting isolated bursts of faults
• Title not available (Why is that?)

Cited In (1)

• Some modern perspectives on the quest for ultimate knowledge

This page was built for publication: Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2686112)