Related papers: Extrinsic faulting in $3C$ close packed crystal st…
An asymmetric exclusion model on an open chain with random rates for hopping particles, where overtaking is also possible, is studied numerically and by computer simulation. The phase structure of the model and the density profiles near the…
We comment on some conceptual and and technical problems related to computational mechanics, point out some errors in several papers, and straighten out some wrong priority claims. We present explicitly the correct algorithm for…
Fluctuations are inherent to biological systems, arising from the stochastic nature of molecular interactions, and influence various aspects of system behavior, stability, and robustness. These fluctuations can be categorized as intrinsic,…
A variant of coupled-cluster theory is described here, wherein the degrees of freedom are fluctuations of fragments between internally correlated states. The effects of intra-fragment correlation on the inter-fragment interaction are…
Scanning probes reveal complex, inhomogeneous patterns on the surface of many condensed matter systems. In some cases, the patterns form self-similar, fractal geometric clusters. In this paper, we advance the theory of criticality as it…
Are there qualitative and quantitative traits of system design that contribute to the ability of people to further innovate? We propose that extrinsic adaptability, the ability given to secondary parties to change a system to match new…
Concurrent pattern calculus (CPC) drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising from pattern matching to pattern unification, interaction becomes…
Environmental noise (e.g.heat, ionized particles, etc.) causes transient faults in hardware, which lead to corruption of stored values. Mission-critical devices require such faults to be mitigated by fault-tolerance --- a combination of…
Mechanistic Interpretability (MI) aims to reverse-engineer model behaviors by identifying functional sub-networks. Yet, the scientific validity of these findings depends on their stability. In this work, we argue that circuit discovery is…
Simulations on a Lennard-Jones computer glass are performed to study effects arising from defects in glasses at low temperatures. The numerical analysis reveals that already a low concentration of defects may dramatically change the low…
Spectral decomposition of matrices is a recurring and important task in applied mathematics, physics and engineering. Many application problems require the consideration of matrices of size three with spectral decomposition over the real…
We apply a probabilistic approach to study the computational complexity of analog computers which solve linear programming problems. We analyze numerically various ensembles of linear programming problems and obtain, for each of these…
The benchmark for computation is typically given as Turing computability; the ability for a computation to be performed by a Turing Machine. Many languages exploit (indirect) encodings of Turing Machines to demonstrate their ability to…
Error invariants are assertions that over-approximate the reachable program states at a given position in an error trace while only capturing states that will still lead to failure if execution of the trace is continued from that position.…
A conception of inhomogeneous locally random distribution of microdefects in crystalline solids is proposed. A method to calculate some physical properties of solids, containing inhomogeneously distributed defects, is developed. A…
Difference constraints have been used for termination analysis in the literature, where they denote relational inequalities of the form x' <= y + c, and describe that the value of x in the current state is at most the value of y in the…
We investigate a stationary process's 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…
This work is an enquiry into the circumstances under which entropy methods can give an answer to the questions of both quantum separability and classical correlations of a composite state. Several entropy functionals are employed to examine…
Number types for exact computation are usually based on directed acyclic graphs. A poor graph structure can impair the efficency of their evaluation. In such cases the performance of a number type can be drastically improved by…
First-order probabilistic models combine representational power of first-order logic with graphical models. There is an ongoing effort to design lifted inference algorithms for first-order probabilistic models. We analyze lifted inference…