Sciweavers

ARITH
2007
IEEE
14 years 20 days ago
Efficient polynomial L-approximations
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
Nicolas Brisebarre, Sylvain Chevillard
CIE
2007
Springer
14 years 21 days ago
Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus
We prove confluence of two cut-elimination procedures for the implicational fragment of a standard intuitionistic sequent calculus. One of the cut-elimination procedures uses globa...
Kentaro Kikuchi
CIE
2007
Springer
14 years 21 days ago
Multi-valued Logics, Effectiveness and Domains
Abstract. Effective domain theory is applied to fuzzy logic to give suitable notions of semi-decidable and decidable L-subset. The connection with the notions of fuzzy Turing machi...
Giangiacomo Gerla
CIE
2007
Springer
14 years 21 days ago
The New Promise of Analog Computation
José Félix Costa, Bruno Loff, Jerzy ...
CIE
2007
Springer
14 years 21 days ago
Effective Computation for Nonlinear Systems
Nonlinear dynamical and control systems are an important source of applications for theories of computation over the the real numbers, since these systems are usually to complicate...
Pieter Collins
CIE
2007
Springer
14 years 21 days ago
A Classification of Viruses Through Recursion Theorems
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves ...
CIE
2007
Springer
14 years 21 days ago
K -Trivial Closed Sets and Continuous Functions
We investigate the notion of K-triviality for closed sets and continuous functions. Every K-trivial closed set contains a K-trivial real. There exists a K-trivial 0 1 class with no...
George Barmpalias, Douglas A. Cenzer, Jeffrey B. R...
CIE
2007
Springer
14 years 21 days ago
Definability in the Homomorphic Quasiorder of Finite Labeled Forests
Abstract. We prove that for any k 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowe...
Oleg V. Kudinov, Victor L. Selivanov
CIE
2007
Springer
14 years 21 days ago
A Weakly 2-Random Set That Is Not Generalized Low
A guiding question in the study of weak 2-randomness is whether weak 2-randomness is closer to 1-randomness, or closer to 2randomness. Recent research indicates that the first alte...
Andrew Lewis, Antonio Montalbán, Andr&eacut...
CIE
2007
Springer
14 years 21 days ago
Sofic Trace Subshift of a Cellular Automaton
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. In this paper we study conditions for a sofic subshift t...
Julien Cervelle, Enrico Formenti, Pierre Guillon