Representing these assertions and the experimental data which support them in a computable way means that they could be used in logical reasoning environments, i.e. for automated meta-analyses, or linking hypotheses and results across different levels of neuroscientific experiments.
In the 1930's, well before there were computers, various mathematicians from around the world invented precise, independent definitions of what it means to be computable.
In this question the term computable sequence is defined to mean that the numbers ak are real and there is a Turing machine that, for any pair of positive integers A, B, will print out in order the first A digits of all ak, for k ranging from 1 to B, in a finite number of steps.
Since this transformation is the inverse of the logarithm, the corresponding features are log-normally distributed with mean and covariance computable from [34, equations 5.44, 5.45] (49).
Assuming the Church-Turing thesis, universal Turing machines can compute any function computable by algorithm.
In particular, given an arbitrary, time-periodic flow rate, the axisymmetric velocity profile was obtained by means of two neat and computable maps relating the corresponding Fourier coefficients.
Turing was interested in the question of what it means for a task to be computable, which is one of the foundational questions in the philosophy of computer science.
Fundamental problems in computer science about what is computable by digital machines will change.
In summary, computational science involves working with computable scientific models, which are either constructed from first principles or more frequently as approximations to non-computable models.
