Gunnar Sjodin's scientific contributions
What is this page?
This page lists the scientific contributions of an author, who either does not have a ResearchGate profile, or has not yet added these contributions to their profile.
It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.
If you're a ResearchGate member, you can follow this page to keep up with this author's work.
If you are this author, and you don't want us to display this page anymore, please let us know.
It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.
If you're a ResearchGate member, you can follow this page to keep up with this author's work.
If you are this author, and you don't want us to display this page anymore, please let us know.
Publications (4)
We present and examine a result related to uncertainty reasoning, namely that a certain plausibility measure of Cox's type can be uniquely embedded in a minimal ordered field. This, although a purely mathematical result, can be claimed to imply that every rational method to reason with uncertainty must be based on sets of extended probability distr...
We discuss precise assumptions entailing Bayesianism in the line of investigations started by Cox, and relate them to a recent critique by Halpern. We show that every finite model which cannot be rescaled to probability violates a natural and simple refinability principle. We characterize the acceptable ways to handle uncertainty in infinite models...
A method for converging in the sparse distribution memory, utilizing the Jaeckel activation mechanism, is presented. This is done by identifying the possible errors in the address
An important property for any memory system is the ability to form
higher-level concepts from lower-level ones in a robust way. This
process is in the article called chunking. It is also important that
such higher-level concepts can be analyzed, i.e., broken down into their
constituent parts. This is called probing and clean-up. These issues
have p...
Citations
... The original Kanerva's design is more similar to the immune memory operating (according to the model of Derek Smith, Stephanie Forrest, and Alan Perelson, 1996 [6]). BSDR [7][8][9] is a subclass of Vector Symbolic Architecture (VSA) formed at the turn of the 2000s [10,11]. The general requirements of VSA are local error tolerance, the ability to express complex relationships such as hierarchical, key-value type, symbolic sequences, etc., distributed in long codevectors. ...
... • Arnborg and Sjodin (1999) offer an alternative to Cox's proof with a refinability Axiom that replaces Paris' Density Axiom, with the intent of ruling out Halpern's counterexample. Their subsequent work (Arnborg and Sjodin (2003)) also lists other possible Axioms to replace Density, along with a discussion regarding the implications of both Cox's proof and de Finetti's proof. ...
![[object Object]](https://i1.rgstatic.net/ii/profile.image/818659261943809-1572194986136_Q64/Stefan-Arnborg.jpg)
