The jump is definable in the structure of the degrees of unsolvabilityCOOPER, S. B.Bulletin, new series, of the American Mathematical Society. 1990, Vol 23, Num 1, pp 151-158, issn 0273-0979, 8 p.Article

Bandwidth constraints on problems complete for polynomial timeSUDBOROUGH, I. H.Theoretical computer science. 1983, Vol 26, Num 1-2, pp 25-52, issn 0304-3975Article

Admissible representations of effective cpo'sWEIHRAUCH, K; SCHÄFER, G.Theoretical computer science. 1983, Vol 26, Num 1-2, pp 131-147, issn 0304-3975Article

Some consequences of non-uniform conditions on uniform classesYAP, C. K.Theoretical computer science. 1983, Vol 26, Num 3, pp 287-300, issn 0304-3975Article

On the arithmetic complexicity of matrix Kronecker powersSEROUSSI, G; MA, F.Information processing letters. 1983, Vol 17, Num 3, pp 145-148, issn 0020-0190Article

Perfect stables in graphsCROITORU, C; SUDITU, E.Information processing letters. 1983, Vol 17, Num 1, pp 53-56, issn 0020-0190Article

Gödel's conflicting approaches to effective calculabilitySIEG, Wilfried.Lecture notes in computer science. 2006, pp 536-537, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 2 p.Conference Paper

An analysis of the lemmas of urysohn and urysohn-tietze according to effective borel measurabilityGHERARDI, Guido.Lecture notes in computer science. 2006, pp 199-208, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 10 p.Conference Paper

Logical approaches to computational barriers (Second conference on computability in Europe, CiE 2006, Swansea, UK, June 30 - July 5, 2006)Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-35466-2, 1Vol, XV-608 p, isbn 3-540-35466-2Conference Proceedings

Space bounds for infinitary computationLOWE, Benedikt.Lecture notes in computer science. 2006, pp 319-329, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 11 p.Conference Paper

Computing sums of order-K Fibonacci numbers in log timeER, M. C.Information processing letters. 1983, Vol 17, Num 1, pp 1-5, issn 0020-0190Article

Infinite time register machinesKOEPKE, Peter.Lecture notes in computer science. 2006, pp 257-266, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 10 p.Conference Paper

Two open problems on effective dimensionMAYORDOMO, Elvira.Lecture notes in computer science. 2006, pp 353-359, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 7 p.Conference Paper

What does the incompleteness theorem add to the unsolvability of the halting problem?FRANZEN, Torkel.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-35466-2, 1Vol, p. 198Conference Paper

Algorithms for the certified write-all problemANDERSON, R. J; WOLL, H.SIAM journal on computing (Print). 1997, Vol 26, Num 5, pp 1277-1283, issn 0097-5397Article

Numerical simulations of a quantum algorithm for Hilbert's tenth problemKIEU, Tien D.SPIE proceedings series. 2003, pp 89-95, isbn 0-8194-4965-2, 7 p.Conference Paper

Positive relativizations of complexity classesSELMAN, A. L; XU MEI-RUI; BOOK, R. V et al.SIAM journal on computing (Print). 1983, Vol 12, Num 3, pp 565-579, issn 0097-5397Article

The pseudovariety J is hyperdecidableALMEIDA, J; ZEITOUN, M.Informatique théorique et applications (Imprimé). 1997, Vol 31, Num 5, pp 457-482, issn 0988-3754Article

On the computability of circumscriptionKRISHNAPRASAD, T.Information processing letters. 1988, Vol 27, Num 5, pp 237-243, issn 0020-0190Article

Co-total enumeration degreesSOLON, Boris.Lecture notes in computer science. 2006, pp 538-545, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 8 p.Conference Paper

GÖDEL ET LA THÈSE DE TURING = Gödel and Turing's thesisCASSOU-NOGUES, Pierre.Revue d'histoire des mathématiques. 2008, Vol 14, Num 1, pp 77-111, issn 1262-022X, 35 p.Article

Undecidability in the homomorphic quasiorder of finite labeled forestsKUDINOV, Oleg V; SELIVANOV, Victor L.Lecture notes in computer science. 2006, pp 289-296, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 8 p.Conference Paper

On computing representativesBIRD, R. S; RAVELO, J. N.Information processing letters. 1997, Vol 63, Num 1, pp 1-7, issn 0020-0190Article

Twenty questions to a p-selectorBUHRMAN, H; TORENVLIET, L; VAN EMDE BOAS, P et al.Information processing letters. 1993, Vol 48, Num 4, pp 201-204, issn 0020-0190Article

Page / 58