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

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

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 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

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

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

POLYNOMIAL TIME ENUMERATION REDUCIBILITYSELMAN AL.1978; S.I.A.M.J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 440-457; BIBL. 13 REF.Article

SUR UNE METHODE D'ANALYSE DES CALCULS DE TURING. IMOSCHCHENSKIJ VA.1977; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1977; NO 3; PP. 86-94; ABS. ANGL.; BIBL. 7 REF.Article

Tally versions of the Savitch and Immerman-Szelepcsényi theorems for sublogarithmic spaceGEFFERT, V.SIAM journal on computing (Print). 1993, Vol 22, Num 1, pp 102-113, issn 0097-5397Article

PEBBLING AND BANDWITHSUDBOROUGH IH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 373-383; BIBL. 16 REF.Conference Paper

CLOSURE PROPERTIES OF THREE-WAY AND FOUR-WAY TAPE-BOUNDED TWO-DIMENSIONAL TURING MACHINESINOUE K; TAKANAMI I.1979; INFORM. SCI.; USA; DA. 1979; VOL. 18; NO 3; PP. 247-265; BIBL. 6 REF.Article

KLEINE UNIVERSELLE MEHRDIMENSIONALE TURINGMASCHINEN. = PETITES MACHINES DE TURING UNIVERSELLES MULTIDIMENSIONNELLESKLEINE BUNING H; OTTMANN T.1977; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1977; VOL. 13; NO 4-5; PP. 179-201; ABS. ANGL. RUSSE; BIBL. 21 REF.Article

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

SOME TIME-SPACE TRADEOFF RESULTS CONCERNING SINGLE-TAPE AND OFFLINE TM'SIBARRA OH; MORAN S.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 388-394; BIBL. 6 REF.Article

HALTING SPACE-BOUNDED COMPUTATIONSSIPSER M.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 3; PP. 335-338; BIBL. 10 REF.Article

ON THE POWER OF REAL-TIME TURING MACHINES UNDER VARYING SPECIFICATIONSVITANYI PMB.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 658-671; BIBL. 12 REF.Conference Paper