Results 31 to 40 of about 674,428 (75)
Co-c.e. spheres and cells in computable metric spaces [PDF]
Logical Methods in Computer Science, Volume 7, Issue 3 (August 25,
2011) lmcs:885, 2011 We investigate conditions under which a co-computably enumerable set in a computable metric space is computable. Using higher-dimensional chains and spherical chains we prove that in each computable metric space which is locally computable each co-computably enumerable sphere is computable and each co-c.e. cell with co-c.e.
arxiv +1 more source
Weihrauch-completeness for layerwise computability [PDF]
Logical Methods in Computer Science, 2018 We introduce the notion of being Weihrauch-complete for layerwise computability and provide several natural examples related to complex oscillations, the law of the iterated logarithm and Birkhoff's theorem. We also consider hitting time operators, which
Arno Pauly, Willem Fouché, George Davie
doaj +1 more source
IET Cyber-Physical SystemsWith the current COVID‐19 pandemic, sophisticated epidemiological surveillance systems are more important than ever because conventional approaches have not been able to handle the scope and complexity of this global emergency.
Saket Sarin +6 more
doaj +1 more source
The computability path ordering [PDF]
Logical Methods in Computer Science, 2015 This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by lifting a ...
Frédéric Blanqui +2 more
doaj +1 more source
Computing-Model and Computing-Hardware Selection for ICT Under Societal and Judicial Constraints
IEEE AccessThis article discusses a formalization of aspects of Cyber-Sovereignty (CyS) for information and communication technology (ICT), linking them to technological trustworthiness and deriving an associated paradigm for hard- and software design. The upcoming
Yannik N. Bock +3 more
doaj +1 more source
Closed Sets and Operators thereon: Representations, Computability and Complexity [PDF]
Logical Methods in Computer Science, 2018 The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce.
Carsten Rösnick-Neugebauer
doaj +1 more source
Analysis on Computation-Intensive Status Update in Mobile Edge Computing [PDF]
arXiv, 2020 In status update scenarios, the freshness of information is measured in terms of age-of-information (AoI), which essentially reflects the timeliness for real-time applications to transmit status update messages to a remote controller. For some applications, computational expensive and time consuming data processing is inevitable for status information ...
arxiv
Turing machines can be efficiently simulated by the General Purpose Analog Computer [PDF]
, 2012 The Church-Turing thesis states that any sufficiently powerful computational model which captures the notion of algorithm is computationally equivalent to the Turing machine. This equivalence usually holds both at a computability level and at a computational complexity level modulo polynomial reductions.
arxiv +1 more source
Basics of Intensionalized Data: Presets, Sets, and Nominats [PDF]
Computer Science Journal of Moldova, 2012 In the paper we consider intensional aspects of the notion of data. We advocate an idea that traditional set-theoretic platform should be enhanced with new data structures having explicit intensional component.
Mykola Nikitchenko, Alexey Chentsov
doaj
Electronic Proceedings in Theoretical Computer Science, 2010 Computation with advice is suggested as generalization of both computation with discrete advice and Type-2 Nondeterminism. Several embodiments of the generic concept are discussed, and the close connection to Weihrauch reducibility is pointed out.
Vasco Brattka, Arno Pauly
doaj +1 more source