computable

Also found in: Encyclopedia, Wikipedia.
(redirected from Computability theory)

com·pute

 (kəm-pyo͞ot′)
v. com·put·ed, com·put·ing, com·putes
v.tr.
1. To determine by mathematics, especially by numerical methods: computed the tax due. See Synonyms at calculate.
2. To determine by the use of a computer.
v.intr.
1. To determine an amount or number.
2. To use a computer.
3. To be reasonable, plausible, or consistent; make sense: Your alibi doesn't compute.
n.
Computation: amounts beyond compute.

[French computer, from Old French, from Latin computāre : com-, com- + putāre, to reckon; see pau- in Indo-European roots. N., Late Latin computus, from Latin computāre, to compute.]

com·put′a·bil′i·ty n.
com·put′a·ble adj.
American Heritage® Dictionary of the English Language, Fifth Edition. Copyright © 2016 by Houghton Mifflin Harcourt Publishing Company. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.
ThesaurusAntonymsRelated WordsSynonymsLegend:
Adj.1.computable - may be computed or estimated; "a calculable risk"; "computable odds"; "estimable assets"
calculable - capable of being calculated or estimated; "a calculable risk"; "calculable odds"
Based on WordNet 3.0, Farlex clipart collection. © 2003-2012 Princeton University, Farlex Inc.
Translations
Mentioned in
References in periodicals archive
In the 1989 classic, Penrose used computability theory and logic to indicate that conscious humans could achieve ttc by transcending Godelian limitations.
Discussion of computation focuses on methodological similarities between the fields of computability theory and computational linguistics and how this extends our understanding of their structure.
Computability Theory and Ontological Emergence, JON COGBURN and MARK SILCOX
Computability theory; an introduction to recursion theory.
Basics of Computability theory and Complexity theory will be visited.
In order to formulate it we remind the reader of some notions from computability theory. A language L [subset or equal to] [summation over (term)] * is many-one reducible to a set S [member of] [??] if there is a total computable function h : [summation over (term)] * [right arrow] [??] with x [member of] L [??] h(x) [member of] S, for any x [member of] [summation over (term)] *.
Copyright © 2003-2025 Farlex, Inc Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.