Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Computability")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 273016

  • Page / 10921
Export

Selection :

  • and

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

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

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

Not every domain of a plain decompressor contains the domain of a prefix-free oneANDREEV, Mikhail; RAZENSHTEYN, Ilya; SHEN, Alexander et al.Theoretical computer science. 2011, Vol 412, Num 4-5, pp 482-486, issn 0304-3975, 5 p.Article

Definability as hypercomputational effectCOOPER, S. Barry.Applied mathematics and computation. 2006, Vol 178, Num 1, pp 72-82, issn 0096-3003, 11 p.Article

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

On the Jacopini techniqueKUPER, J.Information and computation (Print). 1997, Vol 138, Num 2, pp 101-123, issn 0890-5401Article

Structured calculational proofBACK, R; GRUNDY, J; VON WRIGHT, J et al.Formal aspects of computing. 1997, Vol 9, Num 5-6, pp 469-483, issn 0934-5043Article

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

On number systems with finite degree of ambiguityHONKALA, J.Information and computation (Print). 1998, Vol 145, Num 1, pp 51-63, issn 0890-5401Article

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

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

An attack on a recursive authentication protocol : A cautionary taleRYAN, P. Y. A; SCHNEIDER, S. A.Information processing letters. 1998, Vol 65, Num 1, pp 7-10, issn 0020-0190Article

Introduction to special section on quantum computationVAZIRANI, U.SIAM journal on computing (Print). 1997, Vol 26, Num 5, pp 1409-1410, issn 0097-5397Article

  • Page / 10921