Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("CALCULABILITE")

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

Results 1 to 25 of 1437

  • Page / 58

Export

Selection :

  • and

Computability on dI-domainsGRUCHALSKI, A.Information and computation (Print). 1996, Vol 124, Num 1, pp 7-19, issn 0890-5401Article

ON SOME PROPERTIES OF (Z,Q)-MACHINES AND (Z,Q)-COMPUTABLE FUNCTIONS.STANKIEWICZ E.1975; PRACE C.O.P.A.N.; POLSKA; DA. 1975; NO 201; PP. 1-24; ABS. RUSSE POL.; BIBL. 7 REF.Article

LAMBDA-CALCULUS TERMS THAT REDUCE TO THEMSELVES.LERCHER B.1976; NOTRE DAME J. FORM. LOGIC; U.S.A.; DA. 1976; VOL. 17; NO 2; PP. 291-292; BIBL. 2 REF.Article

ON SOME PROPERTIES OF (Z,Q)-COMPUTABLE AND (Z,Q)-GENERABLE SETS.STANKIEWICZ E.1975; PRACE C.O. P.A.N.; POLSKA; DA. 1975; NO 203; PP. 1-39; ABS. ANGL. RUSSE; BIBL. 1 P.Article

Z-COMPUTABLE FUNCTIONS AND TAU -COMPUTABLE FUNCTIONS.SIERAJEWSKI A.1975; PRACE C.O. P.A.N.; POLSKA; DA. 1975; NO 210; PP. 1-9; ABS. RUSSE POL.; BIBL. 4 REF.Article

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

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

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

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

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

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

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

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

BUSY BEAVER SETS: CHARACTERIZATIONS AND APPLICATIONSDALEY RP.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 1; PP. 52-67; BIBL. 10 REF.Article

LA CALCULABILITE AU SENS DE MOSCHOVAKIS ET SA RELATION AVEC LA RECURSIVITE PARTIELLE PAR LA NUMERATIONDICHEV AV.1981; SERDIKA; ISSN 0204-4110; BGR; DA. 1981; VOL. 7; NO 2; PP. 117-130; BIBL. 5 REF.Article

ZELLULARE BERECHENBARKEIT VON FUNKTIONEN UEBER N-DIMENSIONALEN ZEICHENSYSTEMEN. = CALCULABILITE CELLULAIRE DES FONCTIONS SUR DES SYSTEMES DE SYMBOLES A N DIMENSIONSWAGNER K.1974; ELEKTRON. INFORM.-VERARBEIT KYBERN.; DTSCH.; DA. 1974; VOL. 10; NO 5-6; PP. 259-269; ABS. ANGL. RUSSE; BIBL. 5 REF.Article

AUGMENTED LOOP LANGUAGES AND CLASSES OF COMPUTABLE FUNCTIONSMACHTEY M.1972; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1972; VOL. 6; NO 6; PP. 603-623; BIBL. 1 P.Serial Issue

RELATIONS ENTRE LES DIFFERENTS TYPES DE CALCULABILITE RELATIVE DES FONCTIONSPOLYAKOV EA; ROZINAS MG.1978; MAT. SBOR; SUN; DA. 1978; VOL. 107; NO 1; PP. 134-145; BIBL. 11 REF.Article

CALCULS FREQUENTIELS DES PREDICATS RECURSIFS ET ENUMERATION FREQUENTIELLE D'ENSEMBLESKINBER EB.1972; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1972; VOL. 205; NO 1; PP. 23-25; BIBL. 4 REF.Serial Issue

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

  • Page / 58