DEGREES OF RANDOMIZED COMPUTABILITY

In this survey we discuss work of Levin and V’yugin on collections of sequences that are non-negligible in the sense that they can be computed by a probabilistic algorithm with positive probability. More precisely, Levin and V’yugin introduced an ordering on collections of sequences that are closed...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The bulletin of symbolic logic 2022-03, Vol.28 (1), p.27-70
Hauptverfasser:	HÖLZL, RUPERT, PORTER, CHRISTOPHER P.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Algorithms Boolean Boolean algebra Collection Computation Logic Randomness Statistical analysis
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!