Find link

language:

Find link is a tool written by Edward Betts.

searching for computability in Europe 13 found (26 total)

Super-recursive algorithm (445 words) [view diff] exact match in snippet view article find links to article

Church–Turing Thesis: Consensus and opposition". Proceedings, Computability in Europe 2006. Lecture notes in computer science, 3988 pp. 125–132 Peter

Drinker paradox (991 words) [view diff] exact match in snippet view article find links to article

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

Decidability (logic) (1,913 words) [view diff] exact match in snippet view article

Mate-in-n Problem of Infinite Chess Is Decidable". Conference on Computability in Europe. Lecture Notes in Computer Science. Vol. 7318. Springer. pp. 78–88

Rod Downey (1,168 words) [view diff] exact match in snippet view article find links to article

was awarded the S. Barry Cooper Prize from the Association for Computability in Europe. This award is awarded every two to three years "to a researcher

Game complexity (2,850 words) [view diff] exact match in snippet view article find links to article

mate-in-n problem of infinite chess is decidable". Conference on Computability in Europe: 78–88. arXiv:1201.5597.{{cite journal}}: CS1 maint: multiple names:

Hypercomputation (3,348 words) [view diff] exact match in snippet view article find links to article

Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006. Proceedings. Lecture

Joel David Hamkins (1,791 words) [view diff] exact match in snippet view article find links to article

World Computes – Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, United Kingdom, June 18–23, 2012. Proceedings

De Finetti's theorem (2,397 words) [view diff] exact match in snippet view article find links to article

computable de Finetti measures", Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice, Lecture Notes

Dyadic rational (3,883 words) [view diff] exact match in snippet view article find links to article

(eds.), Computing with Foresight and Industry: 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019, Proceedings, Lecture Notes

Solomonoff's theory of inductive inference (2,114 words) [view diff] exact match in snippet view article find links to article

Church–Turing Thesis: Consensus and opposition]". Proceedings, Computability in Europe 2006. Lecture Notes in Computer Science, 3988 pp. 125–132. Gasarch

ENIAC (8,328 words) [view diff] exact match in snippet view article find links to article

Benedikt (eds.). Logic and Theory of Algorithms: 4th Conference on Computability in Europe, CiE 2008 Athens, Greece, June 15-20, 2008, Proceedings. Springer

Busy beaver (7,603 words) [view diff] exact match in snippet view article find links to article

Logic in the Real World, Proceedings of the Third Conference on Computability in Europe. pp. 219–227. CiteSeerX 10.1.1.104.3021. This article contains

Delaram Kahrobaei (1,407 words) [view diff] exact match in snippet view article find links to article

semidirect product of (semi)groups in public key cryptography". Computability in Europe 2016. Lecture Notes in Computer Science. Vol. 9709. pp. 132–141