Sciweavers

3333 search results - page 305 / 667
» Abstract Proof Search
Sort
View
157
Voted
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 6 months ago
Effective Complexity and its Relation to Logical Depth
Abstract--Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvant...
Nihat Ay, Markus Mueller, Arleta Szkola
AMC
2006
79views more  AMC 2006»
15 years 6 months ago
Church's thesis meets the N-body problem
``Church's thesis'' is at the foundation of computer science. We point out that with any particular set of physical laws, Church's thesis need not merely be po...
Warren D. Smith
AML
2006
87views more  AML 2006»
15 years 6 months ago
The modal logic of continuous functions on cantor space
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
Philip Kremer
136
Voted
CAGD
2006
97views more  CAGD 2006»
15 years 6 months ago
Conditions for use of a non-selfintersection conjecture
Abstract. Volino and Thalmann have published a conjecture proposing sufficient conditions for non-selfintersection of surfaces. Such conditions may be used in solid modeling, compu...
Lars-Erik Andersson, Neil F. Stewart, Malika Zidan...
COMBINATORICS
2006
221views more  COMBINATORICS 2006»
15 years 6 months ago
Kernels of Directed Graph Laplacians
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
John S. Caughman IV, J. J. P. Veerman