On computable numbers

By G. Folkers, L. Folkers. 2016

295 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/5cc553555ad3dbdf09d4542f644b7e2a997e036f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Michael A. Rodriguez
2. Ranjit Jhala
3. Dimitrios Vytiniotis
4. Eric L. Seidel
5. Hector Geffner
6. Niki Vazou
7. Simon L. Peyton Jones
8. Kenneth L. McMillan

Citations in the corpus

• The Gremlin graph traversal machine and language (invited talk) (2015, background): “If so, that machin e can be programmed to execute any known algorithm [18].”
• Refinement types for Haskell (2014, methodology): “We solve this problem by showing how refinement types may themselves be used to prove termination, by following the classical recipe of proving termination via decreasing metrics [38] as embodied in sized types [20, 42].”
• Model-free, Model-based, and General Intelligence (2018, background): “Artificial Intelligence is a brain child of Alan Turing and his universal computer [Turing, 1936].”