Results 11 to 20 of about 674,428 (75)

Da metamatemática para a ciência cognitiva From metamathematics to Cognitive Science

Trans/Form/Ação, 1999
Neste artigo, propõe-se uma configuração possível para a transição histórico-filosófica de temas investigados no domínio da metamatemática para o domínio da Ciência Cognitiva funcionalista neurocomputacional. A descrição de tal transição é feita por meio
Henrique de Morais Ribeiro
doaj   +1 more source

A demonstration of the uncomputability of parametric models of language acquisition and a biologically plausible alternative

Language Development Research, 2022
The logical problem of language acquisition has been at the forefront of psycholinguistics and behavioral neuroscience for decades. One of the most influential answers to the problem of how successful acquisition occurs on the basis of noisy input ...
Elliot Murphy, Evelina Leivada
doaj   +2 more sources

Robust non-computability of dynamical systems and computability of robust dynamical systems [PDF]

Logical Methods in Computer Science
In this paper, we examine the relationship between the stability of the dynamical system $x^{\prime}=f(x)$ and the computability of its basins of attraction.
Daniel S. Graça, Ning Zhong
doaj   +1 more source

Effective Procedures

Philosophies, 2023
The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that ...
Nathan Salmon
doaj   +1 more source

A Topological Characterization to Arbitrary Resilient Asynchronous Complexity

Mathematics, 2022
In this work, we extend the topology-based framework and method for the quantification and classification of general resilient asynchronous complexity.
Yunguang Yue, Xingwu Liu, Fengchun Lei, Jie Wu   +3 more
doaj   +1 more source

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

Program Algebra for Turing-Machine Programs

Scientific Annals of Computer Science, 2019
This paper presents an algebraic theory of instruction sequences with instructions for Turing tapes as basic instructions, the behaviours produced by the instruction sequences concerned under execution, and the interaction between such behaviours and ...
Jan A. Bergstra, Cornelius A. Middelburg
doaj   +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  

On Accelerations in Science Driven by Daring Ideas: Good Messages from Fallibilistic Rationalism

Studies in Logic, Grammar and Rhetoric, 2015
The first good message is to the effect that people possess reason as a source of intellectual insights, not available to the senses, as e.g. axioms of arithmetic. The awareness of this fact is called rationalism.
Marciszewski Witold
doaj   +1 more source

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