Sciweavers

3690 search results - page 37 / 738
» Computation with classical sequents
Sort
View
CAISE
2006
Springer
14 years 2 months ago
Computers under Attacks!
The war metaphor seems to establish itself as soon as we deal with computer viruses. The concept of war is a central topic of political philosophy. The relationships between "...
Anne Bonfante, Jean-Yves Marion
ENTCS
2006
110views more  ENTCS 2006»
13 years 10 months ago
First Steps in Synthetic Computability Theory
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
Andrej Bauer
PUC
2002
74views more  PUC 2002»
13 years 10 months ago
Smart Playing Cards: A Ubiquitous Computing Game
Abstract. We present the "Smart Playing Cards" application, a ubiquitous computing game that augments a classical card game with information
Kay Römer, Svetlana Domnitcheva
TCS
2011
13 years 5 months ago
Computational processes, observers and Turing incompleteness
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
Klaus Sutner
AMC
2006
119views more  AMC 2006»
13 years 10 months ago
Interval iterative methods for computing Moore-Penrose inverse
In this paper, we import interval method to the iteration for computing Moore-Penrose inverse of the full row (or column) rank matrix. Through modifying the classical Newton itera...
Xian Zhang, Jianfeng Cai, Yimin Wei