Results 61 to 70 of about 3,508,326 (346)
Coalgebraic Quantum Computation
, 2014 Coalgebras generalize various kinds of dynamical systems occuring in mathematics and computer science. Examples of systems that can be modeled as coalgebras include automata and Markov chains.
Roumen, Frank
core +2 more sources
Population Ecology, EarlyView.This study examines the demographic dynamics of two seabird populations on Tromelin Island, 15 years after the eradication of brown rats. The results indicate that these populations are in good health and are expected to continue growing until breeding sites are saturated in about a century.
Merlène Saunier +6 more
wiley +1 more source
The unpredictably eruptive dynamics of spruce budworm populations in eastern Canada
Population Ecology, EarlyView.We examine historical population data for spruce budworm from several locations through the period 1930–1997, and use density‐dependent recruitment curves to test whether the pattern of population growth over time is more consistent with Royama's (1984; Ecological Monographs 54:429–462) linear R(t) model of harmonic oscillation at Green River New ...
Barry J. Cooke, Jacques Régnière
wiley +1 more source
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
Origins of Genetic Coding: Self-Guided Molecular Self-Organisation
Entropy, 2023 The origin of genetic coding is characterised as an event of cosmic significance in which quantum mechanical causation was transcended by constructive computation.
Peter R. Wills
doaj +1 more source
Functional computation as concurrent computation [PDF]
Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96, 1996 We investigate functional computation as a special form of concurrent computation. As formal basis, we use a uniformly confluent core of the π-calculus, which is also contained in models of higher-order concurrent constraint programming. We embed the call-by-need and the call-by-value λ-calculus into the π-calculus.
openaire +2 more sources
Studia Semiotyczne, 2020 DOI: http://doi.org/10.26333/sts.xxxiv1.11 This paper reassesses the criticism of the Lucas-Penrose anti-mechanist argument, based on Gödel’s incompleteness theorems, as formulated by Krajewski (2020): this argument only works with the additional ...
Paula Quinon
doaj
Cloud Computing and Grid Computing 360-Degree Compared [PDF]
, 2008 Cloud Computing has become another buzzword after Web 2.0. However, there are dozens of different definitions for Cloud Computing and there seems to be no consensus on what a Cloud is. On the other hand, Cloud Computing is not a completely new concept; it has intricate connection to the relatively new but thirteen-year established Grid Computing ...
arxiv +1 more source
Computing Power Network: A Survey [PDF]
arXiv, 2022 With the rapid development of cloud computing, edge computing, and smart devices, computing power resources indicate a trend of ubiquitous deployment. The traditional network architecture cannot efficiently leverage these distributed computing power resources due to computing power island effect.
arxiv
Tensor computations in computer algebra systems [PDF]
A. V. Korol'kova, D. S. Kulyabov, and L. A. Sevast'yanov. Tensor
computations in computer algebra systems. Programming and Computer Software,
39(3):135--142, 2013, 2014 This paper considers three types of tensor computations. On their basis, we attempt to formulate criteria that must be satisfied by a computer algebra system dealing with tensors. We briefly overview the current state of tensor computations in different computer algebra systems.
arxiv +1 more source