Results 21 to 30 of about 1,116,546 (296)
Profinite Techniques for Probabilistic Automata and the Markov Monoid Algorithm [PDF]
, 2017 We consider the value 1 problem for probabilistic automata over finite words: it asks whether a given probabilistic automaton accepts words with probability arbitrarily close to 1. This problem is known to be undecidable.
Fijalkow, Nathanaël
core +4 more sources
The Determinacy of Context-Free Games [PDF]
, 2011 We prove that the determinacy of Gale-Stewart games whose winning sets are accepted by real-time 1-counter B\"uchi automata is equivalent to the determinacy of (effective) analytic Gale-Stewart games which is known to be a large cardinal assumption.
Equipe De Logique Mathématique +1 more
core +12 more sources
Normal Functions as a New Way of Defining Computable Functions [PDF]
Computer Science, 2004 Report sets new method of defining computable functions. This is formalization of traditional function descriptions, so it allows to define functions in very intuitive way.
Leszek Dubiel
doaj
, 2013 We define the lower and upper mutual dimensions $mdim(x:y)$ and $Mdim(x:y)$ between any two points $x$ and $y$ in Euclidean space. Intuitively these are the lower and upper densities of the algorithmic information shared by $x$ and $y$.
Case, Adam, Lutz, Jack H.
core +2 more sources
Generating Turing Machines by Use of Other Computation Models [PDF]
Computer Science, 2003 For each problem that can be solved there exists algorithm, which can be described with a program of Turing machine. Because this is very simple model programs tend to be very complicated and hard to analyse by human.
Leszek Dubiel
doaj
Research and Application of Spatial Scientometrics [PDF]
Nongye tushu qingbao xuebao, 2022 [Purpose/Significance] As an important research field of scientometrics, spatial scientometrics has been specifically proposed by scholars to discuss the spatial aspects of scientific research activities.
LI Lanfang, CHEN Yunwei, ZHANG Xue, DENG Yong
doaj +1 more source
Optimistic and Pessimistic Result of Planning and Scheduling Dynamic Processes [PDF]
Computer Science, 1999 The combinatorial optimization is aimed at finding the optimum sequence for a given form of the performance index. This paper deals with the problems of combinatorics optimization.
Wieslaw Wajs
doaj
THEORETICAL ASPECTS OF TEACHING COMPUTER SCIENCE
, 2022 This article describes the relevance of teaching computer science in general, and the problems of teaching students of higher educational institutions, describes the process of selecting a teaching method in groups by a teacher, describes methods of teaching computer science, performs a comparative analysis of methods in terms of the effectiveness of ...
openaire +1 more source
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window [PDF]
, 2010 The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distributed data streams over a time-based sliding window (which contains a ...
Chan, Ho-Leung +3 more
core +3 more sources
Practice-oriented controversies and borrowed epistemic credibility in current evolutionary biology: phylogeography as a case study [PDF]
, 2013 Although there is increasing recognition that theory and practice in science are intimately intertwined, philosophy of science perspectives on scientific controversies have been historically focused on theory rather than practice.
Arroyo-Santos, Alfonso +2 more
core +3 more sources