Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:(%22MACHINE TURING%22)

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 6137

  • Page / 246
Export

Selection :

  • and

ON THE COMPLEXITY OF W-TYPE TURING ACCEPTORSCOHEN R; GOLD A.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 3; PP. 249-272; BIBL. 19 REF.Article

THE HALTING PROBLEM FOR LINEAR TURING ASSEMBLERS.BAER RM; VAN LEEUWEN J.1976; J. COMPUTER SYST.; U.S.A.; DA. 1976; VOL. 13; NO 2; PP. 119-135; BIBL. 10 REF.Article

COMPARISONS AND RESET MACHINES.BOOK RV; GREIBACH SA; WRATHALL C et al.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 113-124; BIBL. 11 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

UEBER EINE MINIMALE UNIVERSELLE TURING-MASCHINE = SUR UNE MACHINE DE TURING UNIVERSELLE MINIMALEPRIESE L.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 67; PP. 244-259; BIBL. 12 REF.Conference Paper

DEGREE PROBLEMS FOR MODULAR MACHINESCOHEN DE.1980; J. SYMB. LOGIC; ISSN 0022-4812; USA; DA. 1980; VOL. 45; NO 3; PP. 510-528; BIBL. 7 REF.Article

DETERMINISTIC SIMULATION OF TAPE-BOUNDED PROBABILISTIC TURING MACHINE TRANSDUCERSGILL J; HUNT J; SIMON J et al.1980; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1980; VOL. 12; NO 3; PP. 333-338; BIBL. 8 REF.Article

SPACE LOWER BOUNDS FOR MAZE THREADABILITY ON RESTRICTED MACHINESCOOK SA; RACKOFF CW.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 3; PP. 636-652; BIBL. 8 REF.Article

CYCLIC CLOSURE PROPERTIES OF AUTOMATA ON A TWO-DIMENSIONAL TAPEINOUE K; TAKANAMI I.1978; INFORM. SCI.; USA; DA. 1978; VOL. 15; NO 3; PP. 229-242; BIBL. 12 REF.Article

COMPUTATIONAL COMPLEXITY OF L(M, N) TAPE-BOUNDED TWO-DIMENSIONAL TURING MACHINESMORITA K; UMEO H; SUGATA K et al.1977; SYST. COMPUTERS CONTROLS; USA; DA. 1977 PUBL. 1979; VOL. 8; NO 6; PP. 17-24; BIBL. 4 REF.Article

COMPLETE SETS AND THE POLYNOMIAL-TIME HIERARCHY.WRATHALL C.1976; THEOR. COMPUTER SCI.; NETH.; DA. 1976 PARU 1977; VOL. 3; NO 1; PP. 23-33; BIBL. 13 REF.Article

A DECISION PROCEDURE USING DISCRETE GEOMETRYHERMAN GT; JACKOWSKI JA.1973; DISCRETE MATH.; NETHERL.; DA. 1973; VOL. 5; NO 2; PP. 131-144; BIBL. 10 REF.Serial Issue

A SIMPLE GENERALIZATION OF TURING COMPUTABILITYTHOMAS WJ.1979; NOTRE DAME J. FORM. LOGIC; USA; DA. 1979; VOL. 20; NO 1; PP. 95-102; BIBL. 2 REF.Article

A NOTE ON CLOSURE PROPERTIES OF THE CLASSES OF SETS ACCEPTED BY TAPE-BOUNDED TWO-DIMENSIONAL TURING MACHINES.INOUE K; TAKANAMI I.1978; INFORM. SCI.; USA; DA. 1978; VOL. 15; NO 2; PP. 143-158; BIBL. 18 REF.Article

On dice and coins: models of computation for random generationFELDMAN, D; IMPAGLIAZZO, R; NAOR, M et al.Information and computation (Print). 1993, Vol 104, Num 2, pp 159-174, issn 0890-5401Article

Turing's Titanic Machine?BARRY COOPER, S.Communications of the ACM. 2012, Vol 55, Num 3, pp 74-83, issn 0001-0782, 10 p.Article

La barrière de Turing = The Turing barrierDELAHAYE, Jean-Paul.Pour la science. 2003, Num 312, pp 90-95, issn 0153-4092, 6 p.Article

EFFICIENT COMPUTATION IN GROUPS AND SIMPLICIAL COMPLEXESSTILLWELL JC.1983; TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY; ISSN 0002-9947; USA; DA. 1983; VOL. 276; NO 2; PP. 715-727; BIBL. 17 REF.Article

ON ELIMINATING NONDETERMINISM FROM TURING MACHINES WHICH USE LESS THAN LOGARITHM WORKTAPE SPACEMONIEN B; SUDBOROUGH IH.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 430-445; BIBL. 9 REF.Conference Paper

AUFZAEHLUNG SUBREKURSIVER KLASSEN UND KONSTRUIERENDE AUTOMATEN = ENUMERATION DE CLASSES SOUS RECURSIVES ET DES AUTOMATES "CONSTRUISANTS"ETTL W; LEITSCH A.1979; OESTERR. AKAD. WISSENSCH., MATH.-NATURWISSENSCH. KL., SITZ.-BER., 2; AUT; DA. 1979; VOL. 188; 1 BIS-3; PP. 23-46; BIBL. 9 REF.Article

RELATIONS BETWEEN DIAGONALIZATION, PROOF SYSTEMS, AND COMPLEXITY GAPSHARTMANIS J.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 8; NO 2; PP. 239-253; BIBL. 9 REF.Article

A NOTE ON CLOSURE PROPERTIES OF THE CLASSES OF SETS ACCEPTED BY TAPE-BOUNDED TWO-DIMENSIONAL TURING MACHINESINOUE R; TARANAMI I.1978; SYST., COMPUT., CONTROLS; ISSN 0096-8765; USA; DA. 1978 PUBL. 1980; VOL. 9; NO 3; PP. 11-19; BIBL. 18 REF.Article

RELATING REFINED SPACE COMPLEXITY CLASSES.SEIFERAS JI.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 14; NO 1; PP. 100-129; BIBL. 1 P.Article

THE OTHER TURING MACHINE.CARPENTER BE; DORAN RW.1977; COMPUTER J.; G.B.; DA. 1977; VOL. 20; NO 3; PP. 269-279; BIBL. 26 REF.Article

AUTOMATON INTROSPECTION.LAING R.1976; J. COMPUTER SYST.; U.S.A.; DA. 1976; VOL. 13; NO 2; PP. 172-183; BIBL. 10 REF.Article

A-CALCULS DE TURING ET COMPLEXITE ESSENTIELLE DES A-INVERSIONS DE MOTS BINAIRESMOSHCHENSKIJ VA.1980; METODY DISKRETN. ANAL.; SUN; DA. 1980; NO 35; PP. 83-92; BIBL. 3 REF.Article

  • Page / 246