Results 291 to 300 of about 3,053,426 (341)
Some of the next articles are maybe not open access.
Parametric Church's Thesis: Synthetic Computability Without Choice
Symposium on Logical Foundations of Computer Science, 2021In synthetic computability, pioneered by Richman, Bridges, and Bauer, one develops computability theory without an explicit model of computation. This is enabled by assuming an axiom equivalent to postulating a function $\phi$ to be universal for the ...
Y. Forster
semanticscholar +1 more source
Turing Computability of Fourier Transforms of Bandlimited and Discrete Signals
IEEE Transactions on Signal Processing, 2020The Fourier transform is an important operation in signal processing. However, its exact computation on digital computers can be problematic. In this paper we consider the computability of the Fourier transform and the discrete-time Fourier transform ...
H. Boche, U. Mönich
semanticscholar +1 more source
Handbook of Mathematical Models for Languages and Computation, 2019
. Equilibrium states are natural dynamical analogs of Gibbs measures in thermodynamic formalism. This paper is devoted to the study of their computability in the sense of Computable Analysis. We show that the unique equilibrium state associated to a pair
Andrew W. Appel
semanticscholar +1 more source
. Equilibrium states are natural dynamical analogs of Gibbs measures in thermodynamic formalism. This paper is devoted to the study of their computability in the sense of Computable Analysis. We show that the unique equilibrium state associated to a pair
Andrew W. Appel
semanticscholar +1 more source
On the Computability of the Secret Key Capacity under Rate Constraints
IEEE International Conference on Acoustics, Speech, and Signal Processing, 2019Secret key generation refers to the problem of generating a common secret key without revealing any information about it to an eaves-dropper. All users observe correlated components of a common source and can further use a rate-limited public channel for
H. Boche, Rafael F. Schaefer, H. Poor
semanticscholar +1 more source
Formalizing computability theory via partial recursive functions
International Conference on Interactive Theorem Proving, 2018We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and we use a ...
Mario M. Carneiro
semanticscholar +1 more source
Nursing Standard, 1991
The Department of Health has launched a new computer system for monitoring adverse drug reactions. The Adverse Drug Reactions On-line Information Tracking system (ADROIT) will allow reports to be processed in days rather than weeks, says the Department.
openaire +2 more sources
The Department of Health has launched a new computer system for monitoring adverse drug reactions. The Adverse Drug Reactions On-line Information Tracking system (ADROIT) will allow reports to be processed in days rather than weeks, says the Department.
openaire +2 more sources
Asymptotic Density and the Theory of Computability: A Partial Survey
Computability and Complexity, 2016The purpose of this paper is to survey recent work on how classical asymptotic density interacts with the theory of computability. We have tried to make the survey accessible to those who are not specialists in computability theory and we mainly state ...
C. Jockusch, P. Schupp
semanticscholar +1 more source
Computability and Analysis, a Historical Approach
Conference on Computability in Europe, 2016The history of computability theory and and the history of analysis are surprisingly intertwined since the beginning of the twentieth century. For one, \'Emil Borel discussed his ideas on computable real number functions in his introduction to measure ...
V. Brattka
semanticscholar +1 more source
On the Uniform Computational Content of Computability Theory
Theory of Computing Systems, 2015We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of theorems in one common setting.
V. Brattka +2 more
semanticscholar +1 more source
Journal of the Franklin Institute, 1997
Nonlinear Computation will provide a framework for the computational science and engineering of the future. Topics such as bifurcation and chaos, and methods such as continuation and branch switching, and features such as stability and sensitivity are basic ingredients in the attempt to understand our world. Nonlinear Computation is indispensable when
openaire +2 more sources
Nonlinear Computation will provide a framework for the computational science and engineering of the future. Topics such as bifurcation and chaos, and methods such as continuation and branch switching, and features such as stability and sensitivity are basic ingredients in the attempt to understand our world. Nonlinear Computation is indispensable when
openaire +2 more sources