Sciweavers

9405 search results - page 22 / 1881
» Computing a Model of Set Theory
Sort
View
IGPL
2008
124views more  IGPL 2008»
14 years 9 months ago
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
Igor Carboni Oliveira, Walter Alexandre Carnielli
ENTCS
2008
91views more  ENTCS 2008»
14 years 9 months ago
A Name Abstraction Functor for Named Sets
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
Vincenzo Ciancia, Ugo Montanari
CSCW
2002
ACM
14 years 9 months ago
Physical and Virtual Tools: Activity Theory Applied to the Design of Groupware
Activity theory is based on the concept of tools mediating between subjects and objects. In this theory, an individual's creative interaction with his or her surroundings can ...
Morten Fjeld, Kristina Lauche, Martin Bichsel, Fre...
TKDE
2008
108views more  TKDE 2008»
14 years 9 months ago
Grid Service Discovery with Rough Sets
The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Ser...
Maozhen Li, Bin Yu, Omer F. Rana, Zidong Wang
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 1 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani