Sciweavers

17 search results - page 4 / 4
» entcs 2011
Sort
View
21
Voted
ENTCS
2011
131views more  ENTCS 2011»
13 years 1 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
106views more  ENTCS 2011»
13 years 1 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...