Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Turing machine")

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 1592

  • Page / 64
Export

Selection :

  • and

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

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

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

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

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

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

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

A note on space complexity of nondeterministic two-dimensional turing machinesITO, A; INOUE, K; TAKANAMI, I et al.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1983, Vol 66, Num 8, pp 508-509, issn 0387-236XArticle

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

On heads versus tapesPAUL, W.Theoretical computer science. 1984, Vol 28, Num 1-2, pp 1-12, issn 0304-3975Article

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

TURING AT 100Nature (London). 2012, Vol 482, Num 7386, issn 0028-0836, 440, 455-465 [12 p.]Article

The low splitting theorem in the difference hierarchyANGSHENG LI.Lecture notes in computer science. 2005, pp 287-296, issn 0302-9743, isbn 3-540-26179-6, 10 p.Conference Paper

Three-way two-dimensional finite automata with rotated inputsINOUE, K; TAKANAMI, I; VOLLMAR, R et al.Information sciences. 1986, Vol 38, Num 3, pp 271-282, issn 0020-0255Article

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

Ces problèmes sans solution = These problems without solutionGENOLINI, Christophe; LESCANNE, Pierre.Recherche (Paris, 1970). 2002, Num 351, pp 54-55, issn 0029-5671Article

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

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

A relationship between two-dimensional finite automata and three-way tape-bounded two-dimensional turing machinesINOUE, K; TAKANAMI, I; TANIGUCHI, H et al.Theoretical computer science. 1983, Vol 24, Num 3, pp 331-336, issn 0304-3975Article

  • Page / 64