Results 11 to 20 of about 29,886 (270)
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 +4 more sources
The computability path ordering [PDF]
Logical Methods in Computer Science, 2015 This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by lifting a ...
Frédéric Blanqui +2 more
doaj +9 more sources
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
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
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
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
The Computational and Pragmatic Approach to the Dynamics of Science [PDF]
Filozofia i Nauka, 2020 Science means here mathematics and those empirical disciplines which avail themselves of mathematical models. The pragmatic approach is conceived in Karl R. Popper’s The Logic of Scientific Discovery (p.
Witold Marciszewski
doaj +1 more source
Computational crystallization [PDF]
Archives of Biochemistry and Biophysics, 2016 Crystallization is a key step in macromolecular structure determination by crystallography. While a robust theoretical treatment of the process is available, due to the complexity of the system, the experimental process is still largely one of trial and error.
Altan, Irem +2 more
openaire +3 more sources
On the information carried by programs about the objects they compute [PDF]
, 2014 In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an infinite tape. What
Hoyrup, Mathieu, Rojas, Cristobal
core +7 more sources