Sciweavers

ENTCS
2011
131views more  ENTCS 2011»
13 years 6 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ā€˜Computational Complexity in Non-Turing Models of Computationā...
Ed Blakey
ENTCS
2011
99views more  ENTCS 2011»
13 years 6 months ago
Symmetry and Composition in Probabilistic Theories
The past decade has seen a remarkable resurgence of the old programme of ļ¬nding more or less a priori axioms for the mathematical framework of quantum mechanics. The new impetus...
Alexander Wilce
ENTCS
2011
61views more  ENTCS 2011»
13 years 6 months ago
Measurements and Confluence in Quantum Lambda Calculi With Explicit Qubits
Alejandro Díaz-Caro, Pablo Arrighi, Manuel ...
ENTCS
2011
56views more  ENTCS 2011»
13 years 6 months ago
Feynman Graphs, and Nerve Theorem for Compact Symmetric Multicategories (Extended Abstract)
d abstract) AndrĀ“e Joyal 1 DĀ“epartement des mathĀ“ematiques UniversitĀ“e du QuĀ“ebec `a MontrĀ“eal Canada Joachim Kock 2 3 Departament de matem`atiques Universitat Aut`onoma de B...
André Joyal, Joachim Kock
ENTCS
2011
106views more  ENTCS 2011»
13 years 6 months ago
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi
SUBSEXPL is a system originally developed to visualise reductions, simpliļ¬cations and normalisations in three important calculi of explicit substitutions and has been applied to...
F. L. C. de Moura, A. V. Barbosa, Mauricio Ayala-R...
ENTCS
2011
129views more  ENTCS 2011»
13 years 6 months ago
Specifying Proof Systems in Linear Logic with Subexponentials
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logicā€™s ļ¬ner control on structural rules, i...
Vivek Nigam, Elaine Pimentel, Giselle Reis