Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Numbering (computability theory) (view), Reduction (computability theory) (view), Mortality (computability theory) (view)

searching for Computability theory 22 found (590 total)

alternate case: computability theory

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

Robert I. Soare (171 words) [view diff] exact match in snippet view article find links to article

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

Semicomputable function (272 words) [view diff] exact match in snippet view article find links to article

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

PR (complexity) (415 words) [view diff] case mismatch in snippet view article

Barry Cooper (2004). Computability Theory. Chapman & Hall. ISBN 1-58488-237-9. Herbert Enderton (2011). Computability Theory. Academic Press. ISBN 978-0-12-384-958-8

Computable real function (334 words) [view diff] exact match in snippet view article find links to article

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

Pointer machine (1,556 words) [view diff] case mismatch in snippet view article find links to article

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

Rice–Shapiro theorem (3,454 words) [view diff] exact match in snippet view article find links to article

In computability theory, the Rice–Shapiro theorem is a generalization of Rice's theorem, named after Henry Gordon Rice and Norman Shapiro. It states that

True arithmetic (1,133 words) [view diff] case mismatch in snippet view article find links to article

recursively enumerable degrees", in Griffor, E.R. (ed.), Handbook of Computability Theory, Studies in Logic and the Foundations of Mathematics, vol. 140, North-Holland

NUS university professor (273 words) [view diff] exact match in snippet view article find links to article

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

Herbert Enderton (223 words) [view diff] case mismatch in snippet view article find links to article

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

Computation tree (293 words) [view diff] case mismatch in snippet view article find links to article

and real number calculations. Griffor, E. R. (1999), Handbook of Computability Theory, Studies in Logic and the Foundations of Mathematics, vol. 140, Elsevier

James Earl Baumgartner (471 words) [view diff] case mismatch in snippet view article find links to article

Jaakko Hintikka, editors, Logic, Foundations of Mathematics and Computability Theory, pages 87–106. Reidel, 1977 Baumgartner, James E.; Galvin, Fred,

Wadge hierarchy (1,336 words) [view diff] exact match in snippet view article find links to article

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 the

Alfred Aho (1,760 words) [view diff] case mismatch in snippet view article find links to article

past president of the ACM Special Interest Group on Algorithms and Computability Theory. Aho, Hopcroft, and Ullman were co-recipients of the 2017 C&C Prize

Richard M. Friedberg (945 words) [view diff] exact match in snippet view article find links to article

theoretical problem in recursion theory called Post's problem. In computability theory there is the decision problem of whether a given number is in a given

Universal Turing machine (2,963 words) [view diff] exact match in snippet view article find links to article

and theoretical computer science Kleene's T predicate – Concept in computability theory Mark and space – States of a communications signal Turing machine

Confluence (abstract rewriting) (1,744 words) [view diff] exact match in snippet view article

39:472-482, 1936 Baader & Nipkow 1998, p. 9. Cooper, S. B. (2004). Computability theory. Boca Raton: Chapman & Hall/CRC. p. 184. ISBN 1584882379. Baader

Anonymous function (2,284 words) [view diff] case mismatch in snippet view article find links to article

Fernandez, Maribel (2009), Models of Computation: An Introduction to Computability Theory, Undergraduate Topics in Computer Science, Springer Science & Business

List of mathematicians born in the 19th century (584 words) [view diff] exact match in snippet view article find links to article

Marston Morse (1892–1977) Emil Leon Post (1897–1954), logic and computability theory Mildred Sanderson (1889–1914) Oswald Veblen (1880–1960) Joseph L

Determinacy (4,120 words) [view diff] no match in snippet view article find links to article

1142/9789812564894_0005. ISBN 978-981-02-4736-2. Soare, Robert I. (2016). Turing Computability: Theory and Applications. Springer. pp. 217ff. ISBN 978-3-6423-1932-7. Kechris

Interaction nets (1,895 words) [view diff] case mismatch in snippet view article find links to article

Models of Computation". Models of Computation: An Introduction to Computability Theory. Springer Science & Business Media. pp. 107–130. ISBN 9781848824348

Diploma in Computer Science (2,731 words) [view diff] exact match in snippet view article find links to article

options, it studies the breakdown of algorithms, graph procedures, and computability theory. Architecture specialization in Computer Science involves digital