Find link

language: af: Afrikaans als: Alemannisch [Alemannic] am: አማርኛ [Amharic] an: aragonés [Aragonese] ar: العربية [Arabic] arz: مصرى [Egyptian Arabic] as: অসমীয়া [Assamese] ast: asturianu [Asturian] az: azərbaycanca [Azerbaijani] azb: تۆرکجه [Southern Azerbaijani] ba: башҡортса [Bashkir] bar: Boarisch [Bavarian] bat-smg: žemaitėška [Samogitian] be: беларуская [Belarusian] be-tarask: беларуская (тарашкевіца) [Belarusian (Taraškievica)] bg: български [Bulgarian] bn: বাংলা [Bengali] bpy: বিষ্ণুপ্রিয়া মণিপুরী [Bishnupriya Manipuri] br: brezhoneg [Breton] bs: bosanski [Bosnian] bug: ᨅᨔ ᨕᨘᨁᨗ [Buginese] ca: català [Catalan] ce: нохчийн [Chechen] ceb: Cebuano ckb: کوردیی ناوەندی [Kurdish (Sorani)] cs: čeština [Czech] cv: Чӑвашла [Chuvash] cy: Cymraeg [Welsh] da: dansk [Danish] de: Deutsch [German] el: Ελληνικά [Greek] en: English eo: Esperanto es: español [Spanish] et: eesti [Estonian] eu: euskara [Basque] fa: فارسی [Persian] fi: suomi [Finnish] fo: føroyskt [Faroese] fr: français [French] fy: Frysk [West Frisian] ga: Gaeilge [Irish] gd: Gàidhlig [Scottish Gaelic] gl: galego [Galician] gu: ગુજરાતી [Gujarati] he: עברית [Hebrew] hi: हिन्दी [Hindi] hr: hrvatski [Croatian] hsb: hornjoserbsce [Upper Sorbian] ht: Kreyòl ayisyen [Haitian] hu: magyar [Hungarian] hy: Հայերեն [Armenian] ia: interlingua [Interlingua] id: Bahasa Indonesia [Indonesian] io: Ido is: íslenska [Icelandic] it: italiano [Italian] ja: 日本語 [Japanese] jv: Basa Jawa [Javanese] ka: ქართული [Georgian] kk: қазақша [Kazakh] kn: ಕನ್ನಡ [Kannada] ko: 한국어 [Korean] ku: Kurdî [Kurdish (Kurmanji)] ky: Кыргызча [Kirghiz] la: Latina [Latin] lb: Lëtzebuergesch [Luxembourgish] li: Limburgs [Limburgish] lmo: lumbaart [Lombard] lt: lietuvių [Lithuanian] lv: latviešu [Latvian] map-bms: Basa Banyumasan [Banyumasan] mg: Malagasy min: Baso Minangkabau [Minangkabau] mk: македонски [Macedonian] ml: മലയാളം [Malayalam] mn: монгол [Mongolian] mr: मराठी [Marathi] mrj: кырык мары [Hill Mari] ms: Bahasa Melayu [Malay] my: မြန်မာဘာသာ [Burmese] mzn: مازِرونی [Mazandarani] nah: Nāhuatl [Nahuatl] nap: Napulitano [Neapolitan] nds: Plattdüütsch [Low Saxon] ne: नेपाली [Nepali] new: नेपाल भाषा [Newar] nl: Nederlands [Dutch] nn: norsk nynorsk [Norwegian (Nynorsk)] no: norsk bokmål [Norwegian (Bokmål)] oc: occitan [Occitan] or: ଓଡ଼ିଆ [Oriya] os: Ирон [Ossetian] pa: ਪੰਜਾਬੀ [Eastern Punjabi] pl: polski [Polish] pms: Piemontèis [Piedmontese] pnb: پنجابی [Western Punjabi] pt: português [Portuguese] qu: Runa Simi [Quechua] ro: română [Romanian] ru: русский [Russian] sa: संस्कृतम् [Sanskrit] sah: саха тыла [Sakha] scn: sicilianu [Sicilian] sco: Scots sh: srpskohrvatski / српскохрватски [Serbo-Croatian] si: සිංහල [Sinhalese] simple: Simple English sk: slovenčina [Slovak] sl: slovenščina [Slovenian] sq: shqip [Albanian] sr: српски / srpski [Serbian] su: Basa Sunda [Sundanese] sv: svenska [Swedish] sw: Kiswahili [Swahili] ta: தமிழ் [Tamil] te: తెలుగు [Telugu] tg: тоҷикӣ [Tajik] th: ไทย [Thai] tl: Tagalog tr: Türkçe [Turkish] tt: татарча/tatarça [Tatar] uk: українська [Ukrainian] ur: اردو [Urdu] uz: oʻzbekcha/ўзбекча [Uzbek] vec: vèneto [Venetian] vi: Tiếng Việt [Vietnamese] vo: Volapük wa: walon [Walloon] war: Winaray [Waray] yi: ייִדיש [Yiddish] yo: Yorùbá [Yoruba] zh: 中文 [Chinese] zh-min-nan: Bân-lâm-gú [Min Nan] zh-yue: 粵語 [Cantonese]

jump to random article

Longer titles found: Computability in Analysis and Physics (view), Computability in Europe (view), Computability logic (view), Computability theory (view), List of computability and complexity topics (view), Logics for computability (view), Index set (computability) (view), Reduction (computability theory) (view), Low (computability) (view), Forcing (computability) (view), High (computability) (view), Basis theorem (computability) (view), Mortality (computability theory) (view)

searching for Computability 120 found (915 total)

alternate case: computability

ACM SIGACT (398 words) [view diff] no match in snippet view article find links to article

ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of

 184 Boolos, George; Burgess, John P.; Jeffrey, Richard C. (2002), Computability and logic (4th ed.), Cambridge University Press, ISBN 978-0-521-00758-0

In computability and complexity theory, ALL is the class of all decision problems. ALL contains all of the complex classes of decision problems, including

In mathematics and computer science, Zeno machines (abbreviated ZM, and also called accelerated Turing machine, ATM) are a hypothetical computational model

Numbers can be classified according to how they are represented or according to the properties that they have. Natural numbers ( N {\displaystyle \mathbb

In mathematics, specifically geometry and topology, the classification of manifolds is a basic question, about which much is known, and many open questions

expressive power of set theory, and with deep connections to questions of computability and provability. Smullyan's exposition takes the form of an imaginary

has done other work in mathematical logic, primarily in the area of computability theory. His doctoral students at the University of Chicago have included

Annotated Turing: A Guided Tour Through Alan Turing’s Historic Paper on Computability and the Turing Machine is a book by Charles Petzold, published in 2008

geometric group theory, computational complexity and the theory of computability. He received his Ph.D. from the University of Michigan in 1966 under

as models of computation, and have sometimes been used in teaching computability. The only variables are OUTPUT (the return value of the procedure) and

geometric group theory, computational complexity and the theory of computability. He received his Ph.D. from the University of Michigan in 1966 under

work on applying tools from algebraic topology to model shared memory computability, and a winner of the 2012 Dijkstra Prize for the introduction and first

research in Bulgaria who developed a Bulgarian school in the theory of computability, namely the algebraic (or axiomatic) recursion theory. He was the 1981

In computability theory, a semicomputable function is a partial function f : Q → R {\displaystyle f:\mathbb {Q} \rightarrow \mathbb {R} } that can be

In computability theory two sets A , B {\displaystyle A,B} of natural numbers are computably isomorphic or recursively isomorphic if there exists a total

Rado's theorem is a theorem from the branch of mathematics known as Ramsey theory. It is named for the German mathematician Richard Rado. It was proved

expectations in history, science, finance, and technology. The non-computability of the probability of consequential rare events using scientific methods

In mathematics, a limit is the value that a function (or sequence) approaches as the argument (or index) approaches some value. Limits of functions are

[at Wikidata] (September 1961). "An Informal Arithmetical Approach to Computability and Computation". Canadian Mathematical Bulletin. 4 (3): 89, 279–293

Beigel, of the textbook The Language of Machines: an Introduction to Computability and Formal Languages. Floyd supervised seven Ph.D. graduates. Floyd

Boolos, George; Burgess, John P.; Jeffrey, Richard (2007) [1974]. Computability and Logic (5th ed.). Cambridge, England: Cambridge University Press

Register machine. George Boolos, John P. Burgess, Richard Jeffrey (2002), Computability and Logic: Fourth Edition, Cambridge University Press, Cambridge, England

quickly as possible the computability of all partial recursive functions Péter's is perhaps the best; for proving their computability by Turing machines a

properties using different types of logic is shown to be equivalent to their computability in different types of resource-bounded models of computation. It was

2016). S. Barry Cooper (2004). Computability Theory. Chapman & Hall. ISBN 1-58488-237-9. Herbert Enderton (2011). Computability Theory. Academic Press.

ISSN 0894-9875. Hogarth, Mark (1994). "Non-Turing Computers and Non-Turing Computability". PSA: Proceedings of the Biennial Meeting of the Philosophy of Science

Schwichtenberg deals with, among other things, proof theory, theory of computability, lambda calculus and applications of logic in computer science. He is

Turing (cipher) Turing College, Kent, England Turing completeness Turing computability Turing degree Turing Foundation, Amsterdam, Netherlands Turing Gateway

machine"?, SIGACT News (ACM Special Interest Group on Automata and Computability Theory)", volume 26, 1995. Wherein Ben-Amram describes the types and

Science, the International Journal of Foundations of Computer Science, Computability, and Natural Computing. In 2022 she was awarded a Simons Fellowship

In mathematics and computability theory, an elementary cellular automaton is a one-dimensional cellular automaton where there are two possible states

to a universal Turing machine). The prior is universal in the Turing-computability sense, i.e. no string has zero probability. It is not computable, but

computation. Includes a little biography of Emil Post. Martin Davis, Computability: with Notes by Barry Jacobs, Courant Institute of Mathematical Sciences

Symbolic Logic in Leeds in July 1997 on sets and proofs and models and computability. The volumes were welcomed by philosopher Graham Priest of the University

ISBN 0-07-004357-4}. George Boolos, John P. Burgess, Richard Jeffrey (2002), Computability and Logic: Fourth Edition, Cambridge University Press, Cambridge, England

Mathematics: Modern Essays, Springer, 1992. ISBN 978-0-7923-1495-0 Computability: Turing, Gödel, Church, and Beyond (with Jack Copeland and Oron Shagrir)

York: Van Nostrand. OCLC 523942. Schwichtenberg, Helmut. "Computability". see under "Computability" Schwichtenberg, Helmut (2007). "Recursion Theory (Notes

In mathematical logic, specifically computability theory, a function f : R → R {\displaystyle f\colon \mathbb {R} \to \mathbb {R} } is sequentially computable

121.1171T. doi:10.1086/318732. Gerlach, E. (2009). "On the Numerical Computability of Asteroidal Lyapunov Times". arXiv:0901.4871 [physics.comp-ph].

x , y ) ∈ R {\displaystyle (x,y)\in R} . Therefore the question of computability of proofs is not separated from the question of their existence. To

mechanism is addressed by, exploring nature with help the ideas of computability, and studying natural processes as computations (information processing)

2005. Fixing Frege, Princeton University Press. ISBN 0691122318 2007. Computability and Logic (with George Boolos and Richard C. Jeffrey), Cambridge University

Elaine (2008). "28.10 "The problem classes FP and FNP"". Automata, computability and complexity: theory and applications. Prentice Hall. pp. 689–694

last number entered Computably enumerable, a property of some sets in computability theory, abbreviated c.e. Computer engineering, a branch of engineering

program could reproduce itself. This constituted a plausibility result in computability theory. Fred Cohen experimented with computer viruses and confirmed

1993b). Hoenigswald (1996). Sager, Naomi & Ngô, Thanh Nhàn (2002). "The computability of strings, transformations, and sublanguage". In Nevin, Bruce & Johnson

Formal Logic: Its Scope and Limits, a basic introduction to logic, and Computability and Logic, a more advanced text dealing with, among other things, the

lemma for Borel sets. Wadge's lemma is similar to the cone lemma from computability theory. The Wadge game is a simple infinite game used to investigate

default gateways Post correspondence problem, an important problem in computability theory Primary Control Program, an option in OS/360 Principia Cybernetica

incompatibility (help). Boolos, G.; Burgess, J. P.; Jeffrey, R. (2007), Computability and Logic (5th ed.), Cambridge: Cambridge University Press, ISBN 978-0-521-87752-7

In mathematics, the resultant of two polynomials is a polynomial expression of their coefficients that is equal to zero if and only if the polynomials

was George W. Whitehead, and his doctoral dissertation was on Finite Computability of the Homotopy Groups of Finite Groups. In 1962–63 he visited the Institute

tt-reduction (truth-table reduction), a kind of transformation used in computability theory <tt>...</tt> (short for teletype), an HTML presentation element

and W. A. Carnielli. Computability: computable functions, logic and the foundations of mathematics, with the timeline Computability and Undecidability.

tumor Seri Maharaja Mangku Negara, a Malaysian honour S-m-n theorem, a computability theorem regarding programming languages Servicio Meteorológico Nacional

hash lemma. Computer programming portal Quantum_computing#Relation_to_computability_and_complexity_theory – Computer hardware technology that uses quantum

combinatorial optimization problems, the identification of polynomial-time computability with the intuitive notion of algorithmic efficiency, and, most notably

sets of points in Euclidean geometry Recursively inseparable sets, in computability theory, pairs of sets of natural numbers that cannot be "separated"

original on 2022-10-09. L. Adleman, J. DeMarrais, and M.-D. Huang. Quantum computability. SIAM J. Comput., 26(5):1524–1540, 1997. George, Michael Goderbauer

"2015:Third St.Petersburg Days of LOGIC and COMPUTABILITY". "2015:Third St.Petersburg Days of LOGIC and COMPUTABILITY". "The Book "Logic around the World" –

ISBN 9780262100649. Full text available online. Jones, Neil D. (1995). "Computability and Complexity from a Programming Perspective (MFPS Draft preview)"

university professors in NUS. Chong Chi Tat, mathematician in recursion/computability theory; former deputy vice chancellor, deputy president and provost

theory George S. Boolos, John P. Burgess, and Richard C. Jeffrey, 2002, Computability and Logic: Fourth Edition, Cambridge University Press, ISBN 0-521-00758-5

three editions of the classic university text on mathematical logic, Computability and Logic. The book is now in its fifth edition, the last two editions

generator used by the Qt development framework Model of computation, in computability theory Music on Console, a console audio player Mars Orbiter Camera

on partial algebras. Akademie-Verlag. Horst Reichel (1987). Initial computability, algebraic specifications, and partial algebras. Clarendon Press.

and Applications (pp. 3-100). Tärnlund, S.Å. (1977). "Horn clause computability". BIT Numerical Mathematics. 17 (2): 215–226. doi:10.1007/BF01932293

converse is proved in Boolos, George S.; Jeffrey, Richard C. (1989). Computability and Logic (3rd ed.). Cambridge University Press. pp. 155–156. ISBN 0-521-38026-X

(eds.), "Weihrauch Complexity in Computable Analysis", Handbook of Computability and Complexity in Analysis, Cham: Springer International Publishing

spite of the negative theoretical results on the joint spectral radius computability, methods have been proposed that perform well in practice. Algorithms

freely as a variable name. a measure in measure theory minimalization in computability theory and Recursion theory the integrating factor in ordinary differential

of several edited volumes, Selman was the coauthor of the textbook Computability and Complexity Theory (with Steve Homer, Springer, 2001; 2nd ed., 2011)

early computer Oracle machine, or oracle, in complexity theory and computability theory Blockchain oracle, a service that connects smart contracts with

Automata may also refer to: Cellular automata, a discrete model studied in computability theory and other disciplines Von Neumann cellular automata, the original

Jaskowski's Discussive Logic. Non-Classical Logics, Model Theory and Computability, North-Holland Publishing Company, Amsterdam, pp. 37–56, 1977. N.C.A

4, 2023. Retrieved June 3, 2015. Homer, Steven and Alan L. (2001). Computability and Complexity Theory. Springer. p. 35. ISBN 978-0-387-95055-6. Archived

estimators can be computed much more quickly and easily. Due to easy computability, method-of-moments estimates may be used as the first approximation

ISBN 9783110221848. Boolos, George; Burgess, John P.; Jeffrey, Richard C. (2002). Computability and Logic. Cambridge University Press. p. 105. ISBN 9780521007580. Baez

2017-09-16. Z. A. Melzak (1961). "An informal arithmetical approach to computability and computation". Canadian Mathematical Bulletin. 4 (3): 279–293. doi:10

Compactness, Omniscience Principles, and the Drinker Paradox" (PDF). Computability in Europe 2010: 2. {{cite journal}}: Cite journal requires |journal=

Co. p. 2. ISBN 3-11-008244-6. Sager, Naomi, and Nhan, Ngo Than, "The computability of strings, transformations, and sublanguage", pp. 78–120. Chapter in

Introduction to Logic. Academic Press. 1972. ISBN 978-0-12-238452-3. Computability Theory: An Introduction to Recursion Theory. Academic Press. 2011.

2002, he has been at the forefront of the effort to understand the computability of market equilibria, with an extensive body of work on the topic. His

D. Gabbay, and P. Gouveia, Springer, 2008) A Mathematical Primer on Computability (with A. Sernadas, J. Rasga and J. Ramos, College Publications, 2018)

strong relationship with Microsoft. In 1996–1997, the company acquired Computability, a Milwaukee-based company, and Elek-Tek, a Chicago-based company, both

Berlin: Walter de Gruyter. Sager, Naomi; Nhàn, Ngô Thanh (2002). "The computability of strings, transformations, and sublanguage". In Nevin, Bruce E; Johnson

MR 1137517, S2CID 11758381 Zheng, Xizhong; Rettinger, Robert (2004), "Weak computability and representation of reals", Mathematical Logic Quarterly, 50 (4–5):

Muchnik's most significant contribution was on the subject of relative computability. He and Richard Friedberg independently introduced the priority method

ISBN 9780385672665. Davis, Martin; Sigal, Ron; Weyuker, Elaine J. (1994), Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science

Bibcode:2008slmc.book.....M. Boolos, George S.; Jeffrey, Richard C. (1980). Computability and Logic. Cambridge University Press. p. 99. Mendelson, Elliott (1997)

and other macromolecules. Linear bounded automaton, a construct in computability theory Location-based advertising, a form of advertising in mobile telecommunications

Bell System Technical Journal: the busy beaver function and its non-computability ("On Non-Computable Functions"). He died in New Smyrna Beach, Florida

Springer. ISBN 978-1-84628-297-3. Kozen, Dexter (1997). Automata and Computability. New York: Springer-Verlag. ISBN 978-0-387-94907-9. Kozen, Dexter (1991)

Rogers, Hartley (1987) [1967], The Theory of Recursive Functions and Effective Computability, First MIT press paperback edition, ISBN 978-0-262-68052-3

"Leopold löwenheim, Life, Work and Early Influence". Provability, Computability and Reflection. Elsevier. ISBN 9780080954967. Brady, Geraldine, 2000

Philosophers (computer science) Halting problem (limits of computability) Turing machine (limits of computability) Two Generals' Problem Broken window fallacy (law

Annotated Turing: A Guided Tour through Alan Turing's Historic Paper on Computability and the Turing Machine (Wiley, 2008) 3D Programming for Windows - Three-Dimensional

1137/0211023. Takamizawa, K.; Nishizeki, T.; Saito, N. (1982). "Linear-time computability of combinatorial problems on series–parallel graphs". Journal of the

shift was the introduction of computation as the ruling metaphor and of computability as a necessary criterion of a good theoretical model. Information is

139. ISBN 978-0-521-88473-0. Homer, Steven; Selman, Alan L. (2011). Computability and Complexity Theory (Second ed.). Springer. ISBN 978-1-4614-0681-5

ISBN 978-1-85233-074-3. Davis, Martin; Sigal, Ron; Weyuker, Elaine J. (1994). Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science

of holomorphic maps: Resurgence of Fatou coordinates, and Poly-time computability of Julia sets Ph.D. Thesis Classifications of parabolic germs and fractal

Memoirs, 1984 Keisler, H. J.; Robbin, Joel. Mathematical Logic and Computability, McGraw-Hill, 1996 Fajardo, Sergio; Keisler, H. J. Model Theory of Stochastic

Fastest Computer (Oxford University Press, 2012) ISBN 978-0-19-960915-4 Computability: Turing, Gödel, Church, and Beyond (MIT Press, 2013). ISBN 978-0-262-52748-4

1988, ISBN 0-387-13715-7. Martin Davis, Ron Sigal, Elaine J. Weyuker, Computability, complexity, and languages: fundamentals of theoretical computer science

mathematician who died in a mountain climbing accident (Gödel-Herbrand) computability thesis: before Church and Turing, in 1933 with Kurt Gödel, they created

Hyperimmune may refer to: A hyperimmune set in computability theory Hyperimmunization, the presence of a larger-than-normal number of antibodies Hyperimmune

Melzak (1961) received 15 May 1961 An Informal Arithmetical Approach to Computability and Computation, Canadian Mathematical Bulletin, vol. 4, no. 3. September

possible data types are often restricted by considerations of simplicity, computability, or regularity. An explicit data type declaration typically allows the

College, Oxford". Wilfried Sieg, 2005, Church without dogma: axioms for computability, Carnegie Mellon University Robin Gandy — The Alan Turing Scrapbook

Melzak, Z. A. (September 1961). "An informal Arithmetical Approach to Computability and Computation". Canadian Mathematical Bulletin. 4 (3): 279–293. doi:10

mathematical logic and proof theory. This work extended into areas such as computability (e.g., Yuri Matiyasevich), algorithmics, computational complexity, and

articles Takamizawa, K.; Nishizeki, T.; Saito, N. (1982), "Linear-time computability of combinatorial problems on series–parallel graphs", Journal of the

(Charles University, 1964), thesis: Vyčíslitelnost ve vztahu k teoriím [On Computability w.r.t. Theories] Docent (Charles University, 1969), thesis: Intensions

intuitive notion of a function being "computable". Like how Turing-computability has many equivalent definitions, Martin-Löf randomness also has many

Company. Boolos, George; Burgess, John P.; Jeffrey, Richard C. (2002). Computability and Logic. Cambridge UK: Cambridge University Press. ISBN 978-0-521-00758-0

The Degrees of Unsolvability: the Ordering of Functions by Relative Computability. In 2009, he was the Gödel Lecturer (Reverse mathematics: the playground

verification) Theory of computation Automata theory (Formal languages) Computability theory Computational complexity theory Concurrency theory VLSI design

bQ\right)=e\left(P,Q\right)^{ab}} Non-degeneracy e ≠ 1 {\displaystyle e\neq 1} Computability There exists an efficient algorithm to compute e {\displaystyle e}