Documents Related by Co-Citation

3 Theory of ω-languages. I. characterizations of ω-context-free languages – R S Cohen, A Y Gold - 1977
1 Does general relativity allow an observer to view an eternity in a finite time – M L - 1992
1 Nonstandard methods in combinatorics and theoretical computer science. Polish Academy of Sciences – M M Richter, M E Szabo - 1988
3 A note on accelerated turing machines – Cristian S Calude, Ludwig Staiger - 2010
10 A New Measure of the Difficulty of Problems – Cristian S. Calude, Elena Calude, Michael J. Dinneen - 2006
16 The many forms of hypercomputation – Toby Ord - 2006
16 Why there is no such discipline as hypercomputation – M Davis
12 Infinite time Turing machines with only one tape – Joel David Hamkins, Daniel Evan Seabold - 2001
8 A complete logic for reasoning about programs via nonstandard model theory, Theoret – H ANDREKA, I NEMETI, I SAIN - 1982
73 A.Lewis, Infinite time turing machines – Joel David Hamkins, Andy Lewis
192 Speech Analysis – Tony Robinson - 1998
43 general relativity allow an observer to view an eternity in a finite time – Mark L. Hogarth - 1992
20 Hypercomputation and the Physical Church-Turing Thesis – Paolo Cotogno - 2003
4 Resource bounded measure and randomness – Klaus Ambos-Spies, Elvira Mayordomo - 1997
1 On autoreducibility – B A Trahtenbrot - 1970
5 Sebastiaan Terwijn, and Xizhong Zheng. Resource bounded randomness and weakly complete problems – Klaus Ambos-Spies - 1997
32 Computability and recursion – Robert I. Soare - 1996
80 Measure and Category – J Oxtoby - 1980
32 On initial segment complexity and degrees of randomness – Joseph S. Miller, Liang Yu