The input/output complexity, which is the complexity of data exchange between the main memory and the external memory, has been elaborately studied by a lot of former researchers. However, the existing works failed to consider the input/output ...

The priority model was introduced to capture “greedy-like” algorithms. Motivated by the success of advice complexity in the area of online algorithms, the fixed priority model was extended to include advice, and a reduction-based framework was ...

The Minimum Vertex Cover P roblem is the optimization problem of finding a vertex cover V c of minimal cardinality in a given graph. It is a classic NP-hard problem, and various algorithms have been suggested for it.

In this paper, we start with ...

Each step that results in a bit of information being “forgotten” by a computing device has an intrinsic energy cost. Although any Turing machine can be rewritten to be thermodynamically reversible without changing the recognized language, finite ...

Nested canalization (NC) is a property of Boolean functions which has been recently extended to multivalued functions. We study the effect of the Van Ham mapping (from multivalued to Boolean functions) on this property. We introduce the class of ...

Motivated by recent applications to entropy theory in dynamical systems, we generalise notions introduced by Matthews and define weakly weighted and componentwise weakly weighted (generalised) quasi-metrics. We then systematise and extend to full ...

We study the class of languages that have membership proofs which can be verified by real-time finite-state machines using only a constant number of random bits, regardless of the size of their inputs. Since any further restriction on the ...

We study the local limit distribution of the number of occurrences of a symbol in words of length n generated at random in a regular language according to a rational stochastic model. We present an analysis of the main local limits when the ...

An iterated uniform finite-state transducer executes the same length-preserving transduction in iterative sweeps. The first sweep occurs on the input string, while any subsequent sweep works on the output of the previous one. All sweeps always ...

• We study Iterated Uniform Finite-State Transducers (IUFSTs) working on unary languages.
• We compare IUFSTs size with that of unary classical finite-state automata.
• We relate IUFSTs and one-way cellular automata recognition power.

We continue our investigation aimed at spotting small fragments of Set Theory (in this paper, sublanguages of Boolean Set Theory) that might be of use in automated proof-checkers based on the set-theoretic formalism. Here we propose a method that ...

Bennett's notion of depth is usually considered to describe, roughly speaking, the usefulness and internal organization of the information encoded into an object such as an infinite binary sequence. We consider a natural way to ...

• We present a robust way to relativize the notion of Bennett's logical depth.
• We ...

It is shown that the toy Turing Tumble, suitably extended with an infinitely long game board and unlimited supply of pieces, is Turing-Complete. This is achieved via direct simulation of a Turing machine. Unlike previously informally ...

We define the class of rapidly left expansive cellular automata, which contains Wolfram's Rule 30, fractional multiplication automata, and many others. Previous results on aperiodicity of columns in space-time diagrams of certain cellular ...

We survey current stage of effective descriptive set theory which was fast evolving in the last decade. Most attention will be given to (effective) quasi-Polish spaces and their important subclasses (Polish spaces, ω-continuous domains)...

The Vietoris space of a Stone space plays an important role in the coalgebraic approach to modal logic. When generalizing this to positive modal logic, there is a variety of relevant hyperspace constructions based on various topologies ...

This paper enriches a pre-existing decision algorithm, which in turn augmented a fragment of Tarski's elementary algebra with one-argument real functions endowed with a continuous first derivative. In its present (still quantifier-free)...

• A formal language RDF* concerned with differentiable real functions is proposed.

A version of time-bounded Kolmogorov complexity, denoted KT, has received attention in the past several years, due to its close connection to circuit complexity and to the Minimum Circuit Size Problem MCSP. Essentially all results ...

• Improved complexity-theoretic hardness results for Kolmogorov complexity.
• ...

According to the Jordan Decomposition Theorem, for any function f : [ 0 , 1 ] → R of bounded variation there exists a pair of nondecreasing functions f 1 , f 2 : [ 0 , 1 ] → R with f = f 1 − f 2. Such a pair is called a Jordan ...

• A function with a non-computable standard Jordan decomposition can have a polytime computable Jordan decomposition.

We consider the network consisting of three nodes 1, 2, 3 connected by two open channels 1 → 2 and 1 → 3. The information present in the node 1 consists of four strings x , y , z , w. The nodes 2, 3 know x , w and need to know y , z, ...

• Finding mimimum private disclosure for the fork network with two users with different backgrounds.

Numerical spiking neural (NSN) P systems are a class of distributed parallel neural computing devices, where the values of numerical variables are used to encode the information, the programs that process the variables are expressed by continuous ...

• A novel Turing complete paradigm of spiking neural P systems with synapses as computational units.
• The Turing completeness of the proposed systems is proved as number generating devices.
• The Turing completeness of the proposed ...