( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Asymptotic density and computably Enumerable Sets.

, , и . J. Math. Log., 13 (2): 1350005 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Paul Schupp

Paul E Logan

Ernst Schupp

Hellmuth Schupp

Alfons Schupp

 

Другие публикации лиц с тем же именем

Some Quantitative Aspects of Fractional Computability, и . CoRR, (2007)Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity., , и . ICALP, том 226 из Lecture Notes in Computer Science, стр. 275-283. Springer, (1986)Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics., , и . J. Math. Log., 24 (2): 2350005:1-2350005:76 (августа 2024)Arrays, Automata and Groups: Some Interconnections.. Automata Networks, том 316 из Lecture Notes in Computer Science, стр. 19-28. Springer, (1986)Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time, , и . LICS, стр. 422-427. IEEE Computer Society, (1988)Asymptotic density and computably Enumerable Sets., , и . J. Math. Log., 13 (2): 1350005 (2013)Generic properties of Whitehead's Algorithm, stabilizers in Aut(Fk) and one-relator groups, , и . CoRR, (2003)Asymptotic Density and the Theory of Computability: A Partial Survey., и . Computability and Complexity, том 10010 из Lecture Notes in Computer Science, стр. 501-520. Springer, (2017)On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory., , и . ICCI, стр. 2-5. IEEE Computer Society, (1992)Computational complexity and the conjugacy problem., и . Comput., 6 (4): 307-318 (2017)