|
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
|
|
7
|
A complete logic for reasoning about programs via nonstandard model theory, part II
– H Andréka, I Németi, I Sain
- 1982
|
|
2
|
A note on accelerated turing machines
– C S Calude, L Staiger
- 2010
|
|
59
|
A.Lewis, Infinite time turing machines
– Joel David Hamkins, Andy Lewis
|
|
11
|
Infinite time Turing machines with only one tape
– Joel David Hamkins, Daniel Evan Seabold
- 2001
|
|
11
|
The many forms of hypercomputation
– Toby Ord
- 2006
|
|
14
|
Hypercomputation and the Physical Church-Turing Thesis
– Paolo Cotogno
- 2003
|
|
11
|
Why there is no such discipline as hypercomputation. This issue
– M Davis
- 2005
|
|
27
|
Does General Relativity Allow an Observer to View an Eternity in a Finite Time
– M Hogarth
- 1992
|
|
9
|
A New Measure of the Difficulty of Problems
– Cristian S. Calude, Elena Calude, Michael J. Dinneen
- 2006
|
|
134
|
Speech Analysis
– Tony Robinson
- 1998
|
|
25
|
Computability and recursion
– Robert I. Soare
- 1996
|
|
21
|
Randomness
– Michiel van Lambalgen
- 2004
|
|
4
|
Resource bounded measure and randomness
– Klaus Ambos-Spies, Elvira Mayordomo
- 1997
|
|
4
|
Sebastiaan Terwijn, and Xizhong Zheng. Resource bounded randomness and weakly complete problems
– Klaus Ambos-Spies
- 1997
|
|
1
|
On autoreducibility
– B A Trahtenbrot
- 1970
|
|
23
|
Mitotic recursively enumerable sets
– R Ladner
- 1973
|
