Sciweavers

7988 search results - page 230 / 1598
» A Useful Undecidable Theory
Sort
View
113
Voted
FOSSACS
2006
Springer
15 years 4 months ago
Guessing Attacks and the Computational Soundness of Static Equivalence
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
Martín Abadi, Mathieu Baudet, Bogdan Warins...
CORR
2007
Springer
111views Education» more  CORR 2007»
15 years 20 days ago
Hypocomputation
Most research into hypercomputation focuses only on machines able to prove stronger results the basic Turing Machine, hence the phrase hypercomputation. However, developing hyperco...
David Love
118
Voted
IANDC
2007
96views more  IANDC 2007»
15 years 19 days ago
A general mathematics of names
We introduce FMG (Fraenkel-Mostowski Generalised) set theory, a generalisation of FM set theory which allows binding of infinitely many names instead of just finitely many names...
Murdoch Gabbay
TSP
2008
121views more  TSP 2008»
15 years 17 days ago
Stochastic Analysis of the LMS Algorithm for System Identification With Subspace Inputs
This paper studies the behavior of the low-rank least mean squares (LMS) adaptive algorithm for the general case in which the input transformation may not capture the exact input s...
Neil J. Bershad, José Carlos M. Bermudez, J...
105
Voted
ATAL
2011
Springer
14 years 20 days ago
The face of emotions: a logical formalization of expressive speech acts
In this paper, we merge speech act theory, emotion theory, and logic. We propose a modal logic that integrates the concepts of belief, goal, ideal and responsibility and that allo...
Nadine Guiraud, Dominique Longin, Emiliano Lorini,...