Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAnts are not Conscious
491
0
0.0
(
0
)
Added by
Russell K. Standish
Publication date
2013
fields
Physics
and research's language is
English
Authors
Russell K. Standish
Ask ChatGPT about the research
No Arabic abstract
Anthropic reasoning is a form of statistical reasoning based upon finding oneself a member of a particular reference class of conscious beings. By considering empirical distribution functions defined over animal life on Earth, we can deduce that the vast bulk of animal life is unlikely to be conscious.
rate research
Read More
High-order, beyond-pairwise interdependencies are at the core of biological, economic, and social complex systems, and their adequate analysis is paramount to understand, engineer, and control such systems. This paper presents a framework to measure high-order interdependence that disentangles their effect on each individual pattern exhibited by a multivariate system. The approach is centred on the local O-information, a new measure that assesses the balance between synergistic and redundant interdependencies at each pattern. To illustrate the potential of this framework, we present a detailed analysis of music scores from J.S. Bach, which reveals how high-order interdependence is deeply connected with highly non-trivial aspects of the musical discourse. Our results place the local O-information as a promising tool of wide applicability, which opens new perspectives for analysing high-order relationships in the patterns exhibited by complex systems.
It is shown that prize changes of the US dollar - German Mark exchange rates upon different delay times can be regarded as a stochastic Marcovian process. Furthermore we show that from the empirical data the Kramers-Moyal coefficients can be estimated. Finally, we present an explicite Fokker-Planck equation which models very precisely the empirical probabilitiy distributions.
We investigate a stationary processs crypticity---a measure of the difference between its hidden state information and its observed information---using the causal states of computational mechanics. Here, we motivate crypticity and cryptic order as physically meaningful quantities that monitor how hidden a hidden process is. This is done by recasting previous results on the convergence of block entropy and block-state entropy in a geometric setting, one that is more intuitive and that leads to a number of new results. For example, we connect crypticity to how an observer synchronizes to a process. We show that the block-causal-state entropy is a convex function of block length. We give a complete analysis of spin chains. We present a classification scheme that surveys stationary processes in terms of their possible cryptic and Markov orders. We illustrate related entropy convergence behaviors using a new form of foliated information diagram. Finally, along the way, we provide a variety of interpretations of crypticity and cryptic order to establish their naturalness and pervasiveness. Hopefully, these will inspire new applications in spatially extended and network dynamical systems.
In this paper, we study a probabilistic reinforcement-learning model for ants searching for the shortest path(s) between their nest and a source of food. In this model, the nest and the source of food are two distinguished nodes $N$ and $F$ in a finite graph $mathcal G$. The ants perform a sequence of random walks on this graph, starting from the nest and stopped when first hitting the source of food. At each step of its random walk, the $n$-th ant chooses to cross a neighbouring edge with probability proportional to the number of preceding ants that crossed that edge at least once. We say that {it the ants find the shortest path} if, almost surely as the number of ants grow to infinity, almost all the ants go from the nest to the source of food through one of the shortest paths, without loosing time on other edges of the graph. Our contribution is three-fold: (1) We prove that, if $mathcal G$ is a tree rooted at $N$ whose leaves have been merged into node $F$, and with one edge between $N$ and $F$, then the ants indeed find the shortest path. (2) In contrast, we provide three examples of graphs on which the ants do not find the shortest path, suggesting that in this model and in most graphs, ants do not find the shortest path. (3) In all these cases, we show that the sequence of normalised edge-weights converge to a {it deterministic} limit, despite a linear-reinforcement mechanism, and we conjecture that this is a general fact which is valid on all finite graphs. To prove these results, we use stochastic approximation methods, and in particular the ODE method. One difficulty comes from the fact that this method relies on understanding the behaviour at large times of the solution of a non-linear, multi-dimensional ODE.
We construct rich families of Schrodinger operators on symmetric graphs, both quantum and combinatorial, whose spectral degeneracies are persistently larger than the maximal dimension of an irreducible representations of the symmetry group.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
