Peter Gács

Available identifiers

zbMath Open gacs.peterMaRDI QIDQ200200

List of research outcomes

Publication	Date of Publication	Type
Probabilistic cellular automata with Andrei Toom	2023-06-22	Paper
Inequalities for space-bounded Kolmogorov complexity	2023-01-12	Paper
Stable multi-level monotonic eroders	2022-02-14	Paper
A reliable Turing machine	2021-12-03	Paper
A new version of Toom's proof	2021-05-12	Paper
Stable Multi-Level Monotonic Eroders	2018-09-25	Paper
Clairvoyant embedding in one dimension	2015-11-13	Paper
Thermodynamics of computation and information distance	2015-05-07	Paper
Compatible sequences and a slow Winkler percolation	2015-02-27	Paper
Algorithmic tests and randomness with respect to a class of measures	2014-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5414622	2014-05-07	Paper
A Turing Machine Resisting Isolated Bursts of Faults	2012-06-15	Paper
Clairvoyant scheduling of random walks	2012-04-24	Paper
https://portal.mardi4nfdi.de/entity/Q5390000	2012-04-24	Paper
https://portal.mardi4nfdi.de/entity/Q3224090	2012-03-29	Paper
Randomness on computable probability spaces -- a dynamical point of view	2011-05-23	Paper
Clairvoyant scheduling of random walks	2010-08-05	Paper
The angel wins	2007-06-19	Paper
Uniform test of algorithmic randomness over a general space	2005-09-22	Paper
Correction to "Algorithmic statistics"	2005-05-11	Paper
Compatible Sequences and a Slow Winkler Percolation	2005-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4473230	2004-08-04	Paper
Algorithmic statistics	2002-08-04	Paper
Quantum algorithmic entropy	2002-01-27	Paper
Reliable cellular automata with self-organization	2001-08-28	Paper
The Clairvoyant Demon Has a Hard Task	2001-04-17	Paper
A Toom rule that increases the thickness of sets.	2000-02-02	Paper
Information distance	1999-11-21	Paper
https://portal.mardi4nfdi.de/entity/Q4763384	1995-04-11	Paper
Lower bounds for the complexity of reliable Boolean circuits with noisy gates	1995-03-05	Paper
https://portal.mardi4nfdi.de/entity/Q4302456	1994-09-13	Paper
Kolmogorov's contributions to information theory and algorithmic complexity	1989-01-01	Paper
A simple three-dimensional real-time reliable cellular array	1988-01-01	Paper
Reliable computation with cellular automata	1986-01-01	Paper
Every sequence is reducible to a random one	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3680046	1985-01-01	Paper
On the relation between descriptional complexity and algorithmic probability	1983-01-01	Paper
Causal nets or what is a deterministic computation?	1982-01-01	Paper
Khachiyan’s algorithm for linear programming	1981-01-01	Paper
Causal nets or what is a deterministic computation?	1981-01-01	Paper
Exact Expressions for Some Randomness Tests	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4181100	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3859093	1978-01-01	Paper
Correction to bounds on conditional probabilities with applications	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4132117	1977-01-01	Paper
Some Remarks on Generalized Spectra	1977-01-01	Paper
Spreading of sets in product spaces and hypercontraction of the Markov operator	1976-01-01	Paper
Bounds on conditional probabilities with applications in multi-user communication	1976-01-01	Paper
On a problem of Cox concerning point processes in \(R^k\) of `controlled variability'	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4042829	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4074808	1974-01-01	Paper
Hausdorff-dimension and probability distributions	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4079503	1973-01-01	Paper
Packing of convex sets in the plane with a great number of neighbours	1972-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Peter Gács