Related papers: Dense-choice Counter Machines revisited
I discuss some of the main interpretations given to explain the indeterministic nature of quantum measurements and show that all has some loopholes in one corner or another. I propose an alternative interpretation based on the notion of…
We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines. Thus, we…
We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…
This article presents a research work on the design and synthesis of sequential circuits and flip-flops that are available in digital arena; and describes a new synthesis design of reversible counter that is optimized in terms of quantum…
We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We prove (CH) that the monadic theory of…
We study a control system resembling a singularly perturbed system whose variables are decomposed into groups that change their values with rates of different orders of magnitude. We establish that the slow trajectories of this system are…
We consider a general class of decision problems concerning formal languages, called ``(one-dimensional) unboundedness predicates'', for automata that feature reversal-bounded counters (RBCA). We show that each problem in this class reduces…
This paper studies the identification of nonlinearly parameterized control systems in given experiments. Several identifiability criteria are established and an implementable algorithm is proposed for practicality with the convergence rate…
Much work on argument systems has focussed on preferred extensions which define the maximal collectively defensible subsets. Identification and enumeration of these subsets is (under the usual assumptions) computationally demanding. We…
We propose a framework for nonparametric identification and estimation of discrete choice models with unobserved choice sets. We recover the joint distribution of choice sets and preferences from a panel dataset on choices. We assume that…
We study semantic and syntactic properties of spherical orders and their elementary theories, including finite and dense orders and their theories. It is shown that theories of dense $n$-spherical orders are countably categorical and…
In this paper we study various properties of finite stochastic systems or hidden Markov chains as they are alternatively called. We discuss their construction following different approaches and we also derive recursive filtering formulas…
Higher order set theory has been a topic of interest for some time, with recent efforts focused on the strength of second order set theories [KW16]. In this paper we strive to present one 'theory of collections' that allows for a formal…
There are many types of automata and grammar models that have been studied in the literature, and for these models, it is common to determine whether certain problems are decidable. One problem that has been difficult to answer throughout…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
The store language of a machine of some arbitrary type is the set of all store configurations (state plus store contents but not the input) that can appear in an accepting computation. New algorithms and characterizations of store languages…
A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We show decidability of the diagonal problem for schemes. This…
In this paper, we study the weighted difference substitutions from geometrical views. First, we give the geometric meanings of the weighted difference substitutions, and introduce the concept of convergence of the sequence of substitution…
Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…
We characterize countable dimensionality and strong countable dimensionality by means of an infinite game.