CIE 2010 - PDF Preprint Papers

CIE 2010 Conference on Computability in Europe

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CIE-2010 Paper

click to vote

CIE
2010
Springer

220views Applied Computing» more CIE 2010»

Focusing in Asynchronous Games

13 years 9 months ago

Download www.pps.jussieu.fr

Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...

Samuel Mimram

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	220	Focusing in Asynchronous Games	claim
2	214	Circuit Complexity and Multiplicative Complexity of Boolean Functions	claim
3	195	A Faster Algorithm for Finding Minimum Tucker Submatrices	claim
4	194	Processes in Space	claim
5	161	Haskell before Haskell: Curry's Contribution to Programming (1946-1950)	claim
6	159	Spatial Models for Virtual Networks	claim
7	158	How Powerful Are Integer-Valued Martingales?	claim
8	151	Avoiding Simplicity Is Complex	claim
9	151	Computability of Countable Subshifts	claim
10	141	On the Completeness of Quantum Computation Models	claim
11	141	The Limits of Tractability in Resolution-Based Propositional Proof Systems	claim
12	140	Higher-Order Containers	claim
13	139	Computable Ordered Abelian Groups and Fields	claim
14	134	The Peirce Translation and the Double Negation Shift	claim
15	134	PuzzleTale: A tangible puzzle game for interactive storytelling	claim
16	130	Computational Complexity Aspects in Membrane Computing	claim
17	130	What Is the Problem with Proof Nets for Classical Logic?	claim
18	128	Ergodic-Type Characterizations of Algorithmic Randomness	claim
19	124	Approximate Self-assembly of the Sierpinski Triangle	claim
20	123	Proofs, Programs, Processes	claim
21	121	The Strength of the Besicovitch-Davies Theorem	claim
22	119	Lower Bounds for Reducibility to the Kolmogorov Random Strings	claim
23	113	Computational Interpretations of Analysis via Products of Selection Functions	claim
24	110	Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program	claim
25	110	Scalable personalization of interactive experiences through creative automation	claim
26	101	Undecidability in Weihrauch Degrees	claim
27	100	Kolmogorov Complexity Cores	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers