20 research outputs found
The Computational Power of Neural Networks and Representations of Numbers in Non-Integer Bases
We briefly survey the basic concepts and results concerning the computational power of neural net-orks which basically depends on the information content of eight parameters. In particular, recurrent neural networks with integer, rational, and arbitrary real weights are classi ed within the Chomsky and finer complexity hierarchies. Then we re ne the analysis between integer and rational weights by investigating an intermediate model of integer-weight neural networks with an extra analog rational-weight neuron (1ANN). We show a representation theorem which characterizes the classification problems solvable by 1ANNs, by using so-called cut languages. Our analysis reveals an interesting link to an active research field on non-standard positional numeral systems with non-integer bases. Within this framework, we introduce a new concept of quasi-periodic numbers which is used to classify the computational power of 1ANNs within the Chomsky hierarchy
On the Skolem Problem for Continuous Linear Dynamical Systems
The Continuous Skolem Problem asks whether a real-valued function satisfying
a linear differential equation has a zero in a given interval of real numbers.
This is a fundamental reachability problem for continuous linear dynamical
systems, such as linear hybrid automata and continuous-time Markov chains.
Decidability of the problem is currently open---indeed decidability is open
even for the sub-problem in which a zero is sought in a bounded interval. In
this paper we show decidability of the bounded problem subject to Schanuel's
Conjecture, a unifying conjecture in transcendental number theory. We
furthermore analyse the unbounded problem in terms of the frequencies of the
differential equation, that is, the imaginary parts of the characteristic
roots. We show that the unbounded problem can be reduced to the bounded problem
if there is at most one rationally linearly independent frequency, or if there
are two rationally linearly independent frequencies and all characteristic
roots are simple. We complete the picture by showing that decidability of the
unbounded problem in the case of two (or more) rationally linearly independent
frequencies would entail a major new effectiveness result in Diophantine
approximation, namely computability of the Diophantine-approximation types of
all real algebraic numbers.Comment: Full version of paper at ICALP'1
The target discounted-sum problem
The target discounted-sum problem is the following: Given a rational discount factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals t? The problem turns out to relate to many fields of mathematics and computer science, and its decidability question is surprisingly hard to solve. We solve the finite version of the problem, and show the hardness of the infinite version, linking it to various areas and open problems in mathematics and computer science: β-expansions, discounted-sum automata, piecewise affine maps, and generalizations of the Cantor set. We provide some partial results to the infinite version, among which are solutions to its restriction to eventually-periodic sequences and to the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving some open problems on discounted-sum automata, among which are the exact-value problem for nondeterministic automata over finite words and the universality and inclusion problems for functional automata
IST Austria Technical Report
The target discounted-sum problem is the following: Given a rational discount factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals t? The problem turns out to relate to many fields of mathematics and computer science, and its decidability question is surprisingly hard to solve. We solve the finite version of the problem, and show the hardness of the infinite version, linking it to various areas and open problems in mathematics and computer science: β-expansions, discounted-sum automata, piecewise affine maps, and generalizations of the Cantor set. We provide some partial results to the infinite version, among which are solutions to its restriction to eventually-periodic sequences and to the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving some open problems on discounted-sum automata, among which are the exact-value problem for nondeterministic automata over finite words and the universality and inclusion problems for functional automata