Using built-in computable data sources, of course. From Wordnik.com. [Wolfram Blog : Mathematica’s True Colors] Reference
"computable" in the technical sense of being decidable or evaluable by the application of a rote procedure or algorithm. From Wordnik.com. [The Computational Theory of Mind] Reference
Turing's original paper concerned computable numbers. From Wordnik.com. [Turing Machines] Reference
The complements of such functions are computable too. From Wordnik.com. [Combinatory Logic] Reference
Why is such a version of state reduction non-computable?. From Wordnik.com. [Quantum Approaches to Consciousness] Reference
All computable functions are computable by Turing machine. From Wordnik.com. [The Church-Turing Thesis] Reference
The computable functionals of type 0 are the natural numbers. From Wordnik.com. [Kurt Gödel] Reference
Synonyms for decidable are: computable, solvable, and recursive. From Wordnik.com. [Computability and Complexity] Reference
Chapter 9 focuses on computable general equilibrium (CGE) models. From Wordnik.com. [Overview and outline of Making Development More Sustainable] Reference
Church's Thesis says that whatever is computable is Turing computable. From Wordnik.com. [The Church-Turing Thesis] Reference
Entscheidungsproblem, Turing took the step of defining computable numbers. From Wordnik.com. [Alan Turing] Reference
The set of primitive recursive functions is a huge class of computable functions. From Wordnik.com. [Computability and Complexity] Reference
It uses computable functionals to interpret the proofs of intuitionistic arithmetic. From Wordnik.com. [Chores] Reference
Macroeconomic models (simulation, growth, computable general equilibrium - CGE, etc.). From Wordnik.com. [Tools and methods for integrated analysis and assessment of sustainable development] Reference
Again, this additional freedom does not result in a new definition of Turing-computable. From Wordnik.com. [Turing Machines] Reference
In fact the Turing-computable functions are just the recursive functions, described below. From Wordnik.com. [Turing Machines] Reference
He says the goal of WolframAlpha is to "make the worlds knowledge computable for everyone.". From Wordnik.com. [Steve Rosenbaum: Is Google Afraid of the Big, Bad, Wolf?] Reference
A mathematical problem is computable if it can be solved in principle by a computing device. From Wordnik.com. [Computability and Complexity] Reference
This class turns out to coincide with the class of the Turing-computable functions introduced by. From Wordnik.com. [Recursive Functions] Reference
Or, put differently, every function that is computable at all, is computable on a Turing machine. From Wordnik.com. [Psychologism] Reference
There is an extensive study and classification of which mathematical problems are computable and which are not. From Wordnik.com. [Computability and Complexity] Reference
Strategy is still a rational computable quantity, but the actual tactics of fighting is something else entirely. From Wordnik.com. [Shock Absorber] Reference
If data exist in computable form, they must be made available in that form, without delay, at minimal or no cost. From Wordnik.com. [Esther Dyson: Release 0.9: HealthDataRights Beta Version] Reference
It follows therefore that there are uncountably many such functions that are not computable by any Turing machine. From Wordnik.com. [Turing Machines] Reference
It says that every algorithmically computable function on the natural numbers can be computed by a Turing machine. From Wordnik.com. [Philosophy of Mathematics] Reference
The idea began to arise that maybe not everything about our universe is fundamentally computable in string theory. From Wordnik.com. [The Landscape - For Real This Time] Reference
It is important to note that Turing identified his prototype neural networks and genetic algorithms as computable. From Wordnik.com. [Alan Turing] Reference
His war work had shown the astounding power of the computable in mechanising expert human procedures and judgments. From Wordnik.com. [Alan Turing] Reference
To demonstrate that some recursive (computable) reals are not genuine real numbers because they fail to satisfy (a) and (b). From Wordnik.com. [Wittgenstein's Philosophy of Mathematics] Reference
It follows immediately that there are uncountably many real numbers that are not computable, since the reals are not countable. From Wordnik.com. [Turing Machines] Reference
The recursive functions, which form a class of computable functions, take their name from the process of "recurrence" or "recursion". From Wordnik.com. [Recursive Functions] Reference
Turing, writing before the invention of the modern digital computer, was interested in the question of what it means to be computable. From Wordnik.com. [Turing Machines] Reference
Areas like optics, statistical mechanics, chemistry, electromagnetics, etc are computable and they provided fairly immediate benefits. From Wordnik.com. [The String Theory Backlash] Reference
And presumably, the reason that they cannot is that specification languages permit one to express notions that are not Turing computable. From Wordnik.com. [The Philosophy of Computer Science] Reference
The basic line of these arguments is that human mathematicians in fact understand and can prove more about arithmetic than is computable. From Wordnik.com. [The Computational Theory of Mind] Reference
Often these logicians took their inspiration from computability issues, for example the study of functions computable in polynomial time. From Wordnik.com. [Provability Logic] Reference
The upshot of this line of thought is that all mental operations are computable and hence realisable on a universal machine: the computer. From Wordnik.com. [Alan Turing] Reference
LearnThatWord and the Open Dictionary of English are programs by LearnThat Foundation, a 501(c)3 nonprofit.
Questions? Feedback? We want to hear from you!
Email us
or click here for instant support.
Copyright © 2005 and after - LearnThat Foundation. Patents pending.