Turing and the Serendipitous Discovery of the Modern ComputerDE SOJO, Aurea Anguera; ARES, Juan; LARA, Juan A et al.Foundations of science. 2013, Vol 18, Num 3, pp 545-557, issn 1233-1821, 13 p.Article

The many forms of hypercomputationORD, Toby.Applied mathematics and computation. 2006, Vol 178, Num 1, pp 143-153, issn 0096-3003, 11 p.Article

Circumventing the Barriers of ComputationNICKERSON, J. V.Semiotica. 1989, Vol 74, Num 3-4, pp 329-335, issn 0037-1998Article

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

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

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

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 1-inkdot alternating Turing machines with small spaceINOUE, K; ITO, A; TAKANAMI, I et al.Theoretical computer science. 1994, Vol 127, Num 1, pp 171-179, issn 0304-3975Article

A turing machine time hierarchyZAK, S.Theoretical computer science. 1983, Vol 26, Num 3, pp 327-333, issn 0304-3975Article

A note on alternating on-line turing machines with only universal statesINOUE, K; TAKANAMI, I; TANIGUCHI, H et al.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1983, Vol 66, Num 6, pp 395-396, issn 0387-236XArticle

A note on the «parallel computation thesis»BLUM, N.Information processing letters. 1983, Vol 17, Num 4, pp 203-205, issn 0020-0190Article

BPP and the polynomial hierarchyLAUTEMANN, C.Information processing letters. 1983, Vol 17, Num 4, pp 215-217, issn 0020-0190Article

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

ASPACE(o(log log n)) is regularIWAMA, K.SIAM journal on computing (Print). 1993, Vol 22, Num 1, pp 136-146, issn 0097-5397Article

The Causal History of Computational Activity : Maudlin and OlympiaBARNES, E.The Journal of philosophy. 1991, Vol 88, Num 6, pp 304-316, issn 0022-362XArticle

First-order linear logic without modalities is NEXPTIME-hardLINCOLN, P; SCEDROV, A.Theoretical computer science. 1994, Vol 135, Num 1, pp 139-153, issn 0304-3975Conference Paper

Nonerasing turing machines: a frontier between a decidable halting problem and universalityMARGENSTERN, M.Theoretical computer science. 1994, Vol 129, Num 2, pp 419-424, issn 0304-3975Article

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

FINITE-CHANGE AUTOMATAVON BRAUNMUEHL B; VERBEEK R.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 67; PP. 91-100; BIBL. 7 REF.Conference Paper