Search results for "CTD"

Nonstochastic languages as projections of 2-tape quasideterministic languages

1998

A language L (n) of n-tuples of words which is recognized by a n-tape rational finite-probabilistic automaton with probability 1-e, for arbitrary e > 0, is called quasideterministic. It is proved in [Fr 81], that each rational stochastic language is a projection of a quasideterministic language L (n) of n-tuples of words. Had projections of quasideterministic languages on one tape always been rational stochastic languages, we would have a good characterization of the class of the rational stochastic languages. However we prove the opposite in this paper. A two-tape quasideterministic language exists, the projection of which on the first tape is a nonstochastic language.

Research of Complex Forms in Cellular Automata by Evolutionary Algorithms

2004

This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.

A New Universal Cellular Automaton Discovered by Evolutionary Algorithms

2004

In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers provides elements of answer, as it describes how another universal cellular automaton than the Game of Life (Life) was sought and found using evolutionary algorithms. This paper includes a demonstration that consists in showing that the presented R automaton can both implement any logic circuit (logic universality) and a simulation of Life (universality in the Turing sense).

Dose assorbita negli esami TC multistrato nell'adulto. Risultati preliminari della prima Survey Nazionale SIRM 2011

2012

Calcifying phytoplankton standing stocks in the North Pacific from the R/V Kilo Moana cruise KM1712

2022

This dataset compiles the CaCO3 standing stocks of living coccolithophores (mg/m³), of detached coccoliths (mg/m³) and the integrated CaCO3 standing stocks of coccolithophores (mg/m²). The samples were collected in the North Pacific between Hawaii and the Gulf of Alaska during the R/V Kilo Moana cruise KM1712 in August 2017, with rosette Niskin bottles equiped with CTD (Sea-Bird SBE 9) at different depths throughout the photic zone including the deep chlorophyll maximum. To estimate the CaCO3 contribution by coccolithophore assemblages in each sample, we carried out the transformation of coccospheres in number of coccoliths, following the estimates by Yang and Wei (2003), and then we adopte…

Immunoproteomic studies on paediatric opsoclonus-myoclonus associated with neuroblastoma

2016

We aimed to identify new cell-membrane antigens implicated in opsoclonus-myoclonus with neuroblastoma. The sera of 3 out of 14 patients showed IgG electron-microscopy immunogold reactivity on SH-SY5Y neuroblastoma cells. Immunoprecipitation experiments using rat brain synaptosomes and SH-SY5Y cells led to the identification of: (1) thirty-one nuclear/cytoplasmic proteins (including antigens HuB, HuC); (2) seven neuronal membrane proteins, including the Shaw-potassium channel Kv3.3 (KCNC3), whose genetic disruption in mice causes ataxia and generalized muscle twitching. Although cell-based assays did not demonstrate direct antigenicity, our findings point to Shaw-related subfamily of the pot…

Co-learnability and FIN-identifiability of enumerable classes of total recursive functions

1994

Co-learnability is an inference process where instead of producing the final result, the strategy produces all the natural numbers but one, and the omitted number is an encoding of the correct result. It has been proved in [1] that co-learnability of Goedel numbers is equivalent to EX-identifiability. We consider co-learnability of indices in recursively enumerable (r.e.) numberings. The power of co-learnability depends on the numberings used. Every r.e. class of total recursive functions is co-learnable in some r.e. numbering. FIN-identifiable classes are co-learnable in all r.e. numberings, and classes containing a function being accumulation point are not co-learnable in some r.e. number…

Iterative pairs and multitape automata

1996

In this paper we prove that if every iterative k-tuple of a language L recognized by a k-tape automaton is very degenerate, then L is recognizable. Moreover, we prove that if L is an aperiodic langnage recognized by a deterministic k-tape automaton, then L is recognizable.

One-Counter Verifiers for Decidable Languages

2013

Condon and Lipton (FOCS 1989) showed that the class of languages having a space-bounded interactive proof system (IPS) is a proper subset of decidable languages, where the verifier is a probabilistic Turing machine. In this paper, we show that if we use architecturally restricted verifiers instead of restricting the working memory, i.e. replacing the working tape(s) with a single counter, we can define some IPS’s for each decidable language. Such verifiers are called two-way probabilistic one-counter automata (2pca’s). Then, we show that by adding a fixed-size quantum memory to a 2pca, called a two-way one-counter automaton with quantum and classical states (2qcca), the protocol can be spac…

Algorithmic Information Theory and Computational Complexity

2013

We present examples where theorems on complexity of computation are proved using methods in algorithmic information theory. The first example is a non-effective construction of a language for which the size of any deterministic finite automaton exceeds the size of a probabilistic finite automaton with a bounded error exponentially. The second example refers to frequency computation. Frequency computation was introduced by Rose and McNaughton in early sixties and developed by Trakhtenbrot, Kinber, Degtev, Wechsung, Hinrichs and others. A transducer is a finite-state automaton with an input and an output. We consider the possibilities of probabilistic and frequency transducers and prove sever…