Stochastic Context-Free Grammars (2004)

Cached

Download Links

by Mark Andrews Th , Mark W. Andrews

Active Bibliography

Phrase-Structure . . . Stochastic Grammars Grammar Induction . . . Conclusion Title Page – Go Back Full, Grammar Induction
1 Language Learning and Nonlinear Dynamical Systems – Mark William Andrews, Ph. D - 2003
3 Computability and Incomputability – Robert I. Soare
32 Computability and recursion – Robert I. Soare - 1996
An all-or-nothing phenomenon for superefficiency – Vladimir Vovk - 2008
15 The tractable cognition thesis – Iris Van Rooij - 2008
Proving Church’s Thesis (Abstract) – Yuri Gurevich
Church’s Thesis – Guram Bezhanishvili
Undecidability of First-Order Logic – Guram Bezhanishvili, Lawrence S. Moss
Effectiveness ∗ – Nachum Dershowitz, Evgenia Falkovich, Gleichung Eine, Diophantische Gleichung - 2011
Undecidability in quantum mechanics – Luigi Foschini - 1998
Submitted to Foundation of Physics Letters – Luigi Foschini - 1998
An Addition Machine Equivalence Universality Nondeterministic Turing Machines (TMs) – A. /prof David Dowe
12 Notions of computability at higher types I – John Longley - 2005
from Turing to Dijkstra” – Book Extract From, Edgar G. Daylight
WHAT IS AN ALGORITHM? (REVISED) – Yuri Gurevich
GUALTIERO PICCININI COMPUTATIONALISM, THE CHURCH–TURING THESIS, AND THE CHURCH–TURING FALLACY – unknown authors
2 A natural axiomatization of Church’s thesis – Nachum Dershowitz, Yuri Gurevich - 2007
2 Historical Projects in Discrete Mathematics and Computer Science – Janet Barnett, Guram Bezhanishvili, Hing Leung, Jerry Lodder, David Pengelley, Desh Ranjan