Results 1 to 10 of about 669,353 (25)

Compact manifolds with computable boundaries [PDF]

Logical Methods in Computer Science, Volume 9, Issue 4 (December 11, 2013) lmcs:891, 2013
We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with computable boundary is computable.
arxiv   +1 more source

The Rise of Quantum Internet Computing [PDF]

arXiv, 2022
This article highlights quantum Internet computing as referring to distributed quantum computing over the quantum Internet, analogous to (classical) Internet computing involving (classical) distributed computing over the (classical) Internet. Relevant to quantum Internet computing would be areas of study such as quantum protocols for distributed nodes ...
arxiv  

Computing Offloading and Semantic Compression for Intelligent Computing Tasks in MEC Systems [PDF]

, 2023
This paper investigates the intelligent computing task-oriented computing offloading and semantic compression in mobile edge computing (MEC) systems. With the popularity of intelligent applications in various industries, terminals increasingly need to offload intelligent computing tasks with complex demands to MEC servers for computing, which is a ...
arxiv   +1 more source

On Computability of Computable Problems [PDF]

arXiv, 2023
Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can execute any algorithm therefore every computable problem is Turing computable.
arxiv  

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

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

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  

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