Results 11 to 20 of about 3,053,426 (341)
Representations of measurable sets in computable measure theory [PDF]
Logical Methods in Computer Science, 2014 This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly countably ...
Klaus Weihrauch +1 more
doaj +1 more source
On the system CL12 of computability logic [PDF]
Logical Methods in Computer Science, 2015 Computability logic (see http://www.csc.villanova.edu/~japaridz/CL/) is a long-term project for redeveloping logic on the basis of a constructive game semantics, with games seen as abstract models of interactive computational problems.
Giorgi Japaridze
doaj +1 more source
A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability [PDF]
International Symposium on Games, Automata, Logics and Formal Verification, 2018 The usual epistemic model S5n for a multi-agent system is based on a Kripke frame, which is a graph whose edges are labeled with agents that do not distinguish between two states.
É. Goubault, J. Ledent, S. Rajsbaum
semanticscholar +1 more source
Computational epigenetics [PDF]
Bioinformatics, 2007 Abstract Epigenetic research aims to understand heritable gene regulation that is not directly encoded in the DNA sequence. Epigenetic mechanisms such as DNA methylation and histone modifications modulate the packaging of the DNA in the nucleus and thereby influence gene expression.
Bock, C., Lengauer, T.
openaire +3 more sources
An Asynchronous Computability Theorem for Fair Adversaries [PDF]
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2018 This paper proposes a simple topological characterization of a large class of fair adversarial models via affine tasks: sub-complexes of the second iteration of the standard chromatic subdivision.
P. Kuznetsov, Thibault Rieutord, Yuan He
semanticscholar +1 more source
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 Note on the Reality of Incomputable Real Numbers and Its Systemic Significance
Systems, 2021 We discuss mathematical and physical arguments contrasting continuous and discrete, limitless discretization as arbitrary granularity. In this regard, we focus on Incomputable (lacking an algorithm that computes in finite time) Real Numbers (IRNs).
Gianfranco Minati
doaj +1 more source
Robust non-computability of dynamical systems and computability of robust dynamical systems [PDF]
Logical Methods in Computer ScienceIn 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
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