Results 171 to 180 of about 199,145 (211)
Some of the next articles are maybe not open access.
Why Turing’s Thesis Is Not a Thesis
2015In 1936 Alan Turing showed that any effectively calculable function is computable by a Turing machine. Scholars at the time, such as Kurt Godel and Alonzo Church, regarded this as a convincing demonstration of this claim, not as a mere hypothesis in need of continual reexamination and justification.
openaire +1 more source
A Generalized Computability Thesis
1977Let M := [F;G], i.e. the smallest set including G which is closed under the functions from F, where F and G are finite. Any numbering v of M implies v-computability on M. The effective numberings of M with respect to F are defined in two equivalent ways, firstly as the class of numberings equivalent to the term numbering, and secondly as the minimal ...
openaire +1 more source
Institutional and supervisory support for the Thesis by Publication
Australian Journal of Education, 2021Shannon Mason +2 more
exaly
Change and continuity in thesis and dissertation writing: The evolution of an academic genre
Journal of English for Academic Purposes, 2020Brian Paltridge, Sue Starfield
exaly