Results 231 to 240 of about 39,507 (262)

Formal equivalence verification

2015
Erik Seligman
exaly   +2 more sources

A criterion for the equivalence of formal singularities

American Journal of Mathematics, 2002
We prove a generalization of the finite determinacy theorem for isolated singularities. The maximal ideal occuring in the finite determinacy theorem is replaced by any ideal annihilating the first cotangent cohomology of a formal singularity over a Noetherian ring. An analogous result holds for finitely generated modules.
Möhring, Konrad, van Straten, Duco
openaire   +1 more source

On the equivalence of Hebbian learning and the SVM formalism

2012 46th Annual Conference on Information Sciences and Systems (CISS), 2012
We show that it is possible to relate the Support Vector Machine formalism to Hebbian Learning in the context of olfactory learning in the insect brain. Since neurons cannot have negative firing rates, two neurons and synaptic inhibition are required to encode a binary classification problem in a biologically realistic way.
Thomas Nowotny, Ramón Huerta
openaire   +1 more source

On Formal Equivalence Verification of Hardware

2008
When modeling the logic functionality, hardware can be viewed as a Finite State Machine (FSM) [7]. The power-up state of hardware cannot be determined uniquely, therefore the FSM modeling the hardware does not have an initial state (or a set of initial states).
openaire   +1 more source

Formalizing the Environment View of Process Equivalence

2004
The notion of program equivalence plays a fundamental role in the understanding of programming related issues in the framework of concurrent/distributive/mobile/global/grid computing. Many observational equivalences have been proposed in the literature.
Yuxi Fu, Xiaoju Dong
openaire   +1 more source

On the Convergence of Formal Equivalence between Embeddings

The Annals of Mathematics, 1981
Let j: X --* W denote the morphism embedding the compact complex manifold X into the manifold W. The formal principle holds (for j) if, given any other embedding j': X'-W' together with a formal isomorphism between j and j', there is an actual isomorphism between j and j' (for definitions see ? 2.1).
openaire   +1 more source

Formalization of equivalence of recursively defined functions

Information Sciences, 1978
Abstract In this paper we use the fixpoint approach in formalizing the equivalence of recursively defined functions within the framework of predicate calculus. The results suggest some general mathematical techniques useful in proving equivalence of recursive programs.
openaire   +1 more source

On Vasyliunas's equivalent conductivity formalism

Journal of Geophysical Research: Space Physics, 1992
The coupling of the ionosphere and magnetosphere can be understood by examining the field‐aligned currents passing between the two. In his treatment of the shielding of the inner magnetosphere, Vasyliunas [1972] developed a mathematical formalism for representing this coupling by a pseudo Ohm's law.
openaire   +1 more source

A theory of formal truth arithmetically equivalent to ID₁

Journal of Symbolic Logic, 1990
AbstractWe present a theory VF of partial truth over Peano arithmetic and we prove that VF and ID1, have the same arithmetical content. The semantics of VF is inspired by van Fraassen's notion of supervaluation.
openaire   +3 more sources

On Equivalence and Containment Problems for Formal Languages

Journal of the ACM, 1977
Harry B. Hunt III, Daniel J. Rosenkrantz
openaire   +2 more sources