On the \(\delta \to 0\) limit in probabilistic complexity

DOI10.1006/JCOM.1994.1018zbMATH Open0812.68081OpenAlexW2083884168MaRDI QIDQ1336484

Mark Kon

Publication date: 24 October 1994

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1994.1018

zbMATH Keywords

probabilistic continuous complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the relation between descriptional complexity and algorithmic probability 👍 👎
• On the computational complexity of approximating distributions by probabilistic automata 👍 👎
• Probabilistic complexity classes and lowness 👍 👎
• On relationships between approximate and probabilistic complexity classes 👍 👎
• Probabilistic Recursion Theory and Implicit Computational Complexity 👍 👎
• On relativized exponential and probabilistic complexity classes 👍 👎
• The Probabilistic Theory of Linear Complexity 👍 👎
• Probabilistic Recursion Theory and Implicit Computational Complexity 👍 👎

This page was built for publication: On the \(\delta \to 0\) limit in probabilistic complexity

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