Description
Book Synopsis.- Invited abstracts.
.- Special Session: Computing Knowledge: Computational Aspects of Epistemic Logics (HaPoC).
.- The theory of enumeration degrees and its fragments.
.- Further extensions of the point to set principle.
.- Uniform distribution and algorithmic randomness.
.- Computable aspects of symbolic dynamics and tilings.
.- How much pattern complexity can help us solve the domino problem ?.
.- Sufficient conditions for non-emptiness of a subshift and computability of its entropy.
.- Reasoning about (Negative) Trust under Uncertainty.
.- Quantum computating from reversible classical computing.
.- Complexity of well-ordered sets in an ordered Abelian group.
.- Invited papers.
.- If CiE Did not Exist, It Would be Necessary to Invent It.
.- Some Open Questions and Recent Results on Computable Banach Spaces.
.- Kolmogorov complexity as a combinatorial tool.
.- Cellular Automata: Communicati
