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

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

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

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

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

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

The logical strength of the uniform continuity theoremBERGER, Josef.Lecture notes in computer science. 2006, pp 35-39, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 5 p.Conference Paper

The standard logic of Z is inconsistentHENSON, M. C.Formal aspects of computing. 1998, Vol 10, Num 3, pp 243-247, issn 0934-5043Article

Comments on: the computation of the convex hull of a simple polygon in linear timeELGINDY, H.Computers and artificial intelligence. 1987, Vol 6, Num 5, pp 437-440, issn 0232-0274Article

Do noetherian modules have noetherian basis functions?SCHUSTER, Peter; ZAPPE, Julia.Lecture notes in computer science. 2006, pp 481-489, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 9 p.Conference Paper

The jump classes of minimal coversLEWIS, Andrew E. M.Lecture notes in computer science. 2006, pp 307-318, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 12 p.Conference Paper

Completeness results for conflict-free vector replacement systemsHOWELL, R. R; ROSIER, L. E.Journal of computer and system sciences (Print). 1988, Vol 37, Num 3, pp 349-366, issn 0022-0000Article

Forcing with random variables and proof complexityKRAJICEK, Jan.Lecture notes in computer science. 2006, pp 277-278, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 2 p.Conference Paper

Degrees of weakly computable realsKENG MENG NG; STEPHAN, Frank; GUOHUA WU et al.Lecture notes in computer science. 2006, pp 413-422, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 10 p.Conference Paper

Relativized degree spectraSOSKOVA, Alexandra A.Lecture notes in computer science. 2006, pp 546-555, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 10 p.Conference Paper

On computable metric spaces Tietze-Urysohn extension is computableWEIHRAUCH, Klaus.Lecture notes in computer science. 2001, pp 357-368, issn 0302-9743, isbn 3-540-42197-1Conference Paper

The Uniformity ConjectureRICHARDSON, Daniel.Lecture notes in computer science. 2001, pp 253-272, issn 0302-9743, isbn 3-540-42197-1Conference Paper

A numerical computation for declarative expressionsMIRO, J; MIRO-JULIA, M.EUROCAST '97International conference on computer aided systems theory and technology. 1997, isbn 84-88912-04-8, p. 125Conference Paper

Banach-Mazur computable functions on metric spacesHERTLING, Peter.Lecture notes in computer science. 2001, pp 69-81, issn 0302-9743, isbn 3-540-42197-1Conference Paper

The Gergonne p-pile problem and the dynamics of the function x → h [(x + r)/p]HARRISON, J; BRENNAN, T; GAPINSKI, S et al.Discrete applied mathematics. 1998, Vol 82, Num 1-3, pp 103-113, issn 0166-218XArticle

Une histoire du calcul artificiel et de ses concepts = A history of artificial calculus and its conceptsMARGUIN, J.Sciences (1969). 1997, Vol 97, Num 1, pp 12-18, issn 0151-0304Article

Correction to «computational complexity of algebraic functions»PIPPENCER, N.Journal of computer and system sciences (Print). 1988, Vol 37, Num 3, pp 395-399, issn 0022-0000Article