Sciweavers

CIE
2010
Springer
13 years 5 months ago
Lower Bounds for Reducibility to the Kolmogorov Random Strings
Abstract. We show the following results for polynomial-time reducibility to RC , the set of Kolmogorov random strings.
John M. Hitchcock
CIE
2010
Springer
13 years 5 months ago
Undecidability in Weihrauch Degrees
Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhu...
CIE
2010
Springer
13 years 8 months ago
PuzzleTale: A tangible puzzle game for interactive storytelling
We describe the design and development of PuzzleTale, an interactive storytelling system that makes use of tangible puzzle pieces on the surface of an interactive table. In the Pu...
Yang Ting Shen, Ali Mazalek
CIE
2010
Springer
13 years 9 months ago
Proofs, Programs, Processes
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
Ulrich Berger, Monika Seisenberger
CIE
2010
Springer
13 years 9 months ago
Computability of Countable Subshifts
We investigate the computability of countable subshifts in one dimension, and their members. Subshifts of Cantor-Bendixson rank one contain only eventually periodic elements. Any ...
Douglas A. Cenzer, S. Ali Dashti, Ferit Toska, Seb...
CIE
2010
Springer
13 years 11 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov
CIE
2010
Springer
14 years 12 days ago
The Limits of Tractability in Resolution-Based Propositional Proof Systems
We study classes of propositional contradictions based on the Least Number Principle (LNP) in the refutation system of Resolution and its generalisations with bounded conjunction, ...
Stefan S. Dantchev, Barnaby Martin
CIE
2010
Springer
14 years 2 months ago
Avoiding Simplicity Is Complex
Eric Allender