Results 21 to 30 of about 674,428 (75)
Frontiers in Psychology, 2014 It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However the concept of recursion as articulated in the context of linguistic analysis has been perennially confused.
Jeffrey eWatumull +4 more
doaj +1 more source
A Complete Theory of Everything (Will Be Subjective)
Algorithms, 2010 Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus.
Marcus Hutter
doaj +1 more source
Approximation systems for functions in topological and in metric spaces [PDF]
Logical Methods in Computer Science, 2013 A notable feature of the TTE approach to computability is the representation of the argument values and the corresponding function values by means of infinitistic names.
Dimiter Skordev
doaj +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
Studies in Logic, Grammar and Rhetoric, 2016 The aim of this paper is an attempt to give an answer to the question what does it mean that a computational system is intelligent. We base on some theses that though debatable are commonly accepted.
Trzęsicki Kazimierz
doaj +1 more source
Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs [PDF]
Logical Methods in Computer Science, 2017 We discuss possibilities of application of Numerical Analysis methods to proving computability, in the sense of the TTE approach, of solution operators of boundary-value problems for systems of PDEs.
Svetlana Selivanova, Victor Selivanov
doaj +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
Diagonal Anti-Mechanist Arguments
Studia Semiotyczne, 2020 DOI: http://doi.org/10.26333/sts.xxxiv1.09 Gödel’s first incompleteness theorem is sometimes said to refute mechanism about the mind. §1 contains a discussion of mechanism.
David Kashtan
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