Search results for " Completeness"
showing 6 items of 16 documents
Ultrametric Finite Automata and Turing Machines
2013
We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.
Quantum Real - Time Turing Machine
2001
The principles of quantum computation differ from the principles of classical computation very much. Quantum analogues to the basic constructions of the classical computation theory, such as Turing machine or finite 1-way and 2-ways automata, do not generalize deterministic ones. Their capabilities are incomparable. The aim of this paper is to introduce a quantum counterpart for real - time Turing machine. The recognition of a special kind of language, that can't be recognized by a deterministic real - time Turing machine, is shown.
Extrapolation of the Species Accumulation Curve for Incomplete Species Samplings: A New Nonparametric Approach to Estimate the Degree of Sample Compl…
2015
9 pages; International audience; Incomplete species samplings are deemed to remain the common practice in those groups of animals, such as small or micro- invertebrates, with numerous species that often are more or less difficult to detect in the field. Thus, extrapolating the Species Accumulation Curve as far as possible beyond the actual sample size may thus serve as a useful (although imperfect) surrogate to the desired, but practically inaccessible, complete samplings. In this context, several kinds of theoretical or empirical models for the Species Accumulation Curve and also a lot of estimators of the asymptotic limit of the Curve (i.e. total species richness) have been proposed. The …
Modal Consequence Relations Extending S4.3: An Application of Projective Unification
2016
We characterize all finitary consequence relations over $\mathbf{S4.3}$ , both syntactically, by exhibiting so-called (admissible) passive rules that extend the given logic, and semantically, by providing suitable strongly adequate classes of algebras. This is achieved by applying an earlier result stating that a modal logic $L$ extending $\mathbf{S4}$ has projective unification if and only if $L$ contains $\mathbf{S4.3}$ . In particular, we show that these consequence relations enjoy the strong finite model property, and are finitely based. In this way, we extend the known results by Bull and Fine, from logics, to consequence relations. We also show that the lattice of consequence relation…
Predictive models in assessment of macroinvertebrates in boreal rivers
2009
Jukka Aroviita tutki väitöskirjassaan jokien ja purojen biologisen tilan mittaamismenetelmiä. Aroviita osoitti, että ihmistoiminnan aiheuttamat biologiset muutokset voivat jäädä havaitsematta, jos eliöyhteisöjen luonnollista taustavaihtelua ei oteta kunnolla huomioon.- Tällöin vesistöjen saatetaan arvioida olevan paremmassa kunnossa kuin ne todellisuudessa ovatkaan. Muutosten tunnistamistarkkuuden tulisi olla mahdollisimman hyvä, sillä tila-arvioilla on myös juridisesti määräytyviä yhteiskunnallisia ja taloudellisia seuraamuksia, Aroviita toteaa. Vielä 1990-luvulla järvien ja jokien tilaa arvioitiin suurelta osin ihmisen näkökulmasta ja veden kemian perusteella. Nykylainsäädäntö edellyttää …
Sensitivity of bipartite network analyses to incomplete sampling and taxonomic uncertainty
2023
Bipartite network analysis is a powerful tool to study the processes structuring interactions in ecological communities. In applying the method, it is assumed that the sampled interactions provide an accurate representation of the actual community. However, acquiring a representative sample may be difficult as not all species are equally abundant or easily identifiable. Two potential sampling issues can compromise the conclusions of bipartite network analyses: failure to capture the full range of interactions (sampling completeness) and use of a taxonomic level higher than species to evaluate the network (taxonomic resolution). We asked how commonly used descriptors of bipartite antagonisti…