Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Machine Turing")

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 1107

  • Page / 45
Export

Selection :

  • and

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

Lower space bounds for accepting shuffle languagesSZEPIETOWSKI, A.Informatique théorique et applications (Imprimé). 1999, Vol 33, Num 3, pp 303-307, issn 0988-3754Article

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

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

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

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

The laterality problem for non-erasing turing machines on {0,1} is completely solvedMARGENSTERN, M.Informatique théorique et applications (Imprimé). 1997, Vol 31, Num 2, pp 159-204, issn 0988-3754Article

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

Historical Reflections Actually, Turing Did Not Invent the ComputerHAIGH, Thomas.Communications of the ACM. 2014, Vol 57, Num 1, pp 36-41, issn 0001-0782, 6 p.Article

Alternation for sublogarithmic space-bounded alternating pushdown automataJIANLIANG XU; YOSHINAGA, Tsunehiro; INOUE, Katsushi et al.Theoretical computer science. 2001, Vol 259, Num 1-2, pp 475-492, issn 0304-3975Article

The Turing closure of an archimedean fieldBOLDI, P; VIGNA, S.Theoretical computer science. 2000, Vol 231, Num 2, pp 143-156, issn 0304-3975Article

Computational complexity of uniform quantum circuit families and quantum Turing machinesNISHIMURA, Harumichi; OZAWA, Masanao.Theoretical computer science. 2002, Vol 276, Num 1-2, pp 147-181, issn 0304-3975Article

Lowness for weakly 1-generic and kurtz-randomSTEPHAN, Frank; LIANG YU.Lecture notes in computer science. 2006, pp 756-764, issn 0302-9743, isbn 3-540-34021-1, 1Vol, 9 p.Conference Paper

On the class NL with oracleBERTONI, A; MAURI, G; SABADINI, N et al.Computers and artificial intelligence. 1987, Vol 6, Num 5, pp 411-420, issn 0232-0274Article

Unraveling k-page graphsKANNAN, R.Information and control. 1985, Vol 66, Num 1-2, pp 1-5, issn 0019-9958Article

Beyond the Turing TestAREL, Itamar; LIVINGSTON, Scott.Computer (Long Beach, CA). 2009, Vol 42, Num 3, pp 90-91, issn 0018-9162, 2 p.Article

The church-turing thesis : Consensus and oppositionDAVIS, Martin.Lecture notes in computer science. 2006, pp 125-132, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 8 p.Conference Paper

On a question of sacks : A partial solution on the positive sideLEWIS, Andrew E. M.Lecture notes in computer science. 2005, pp 275-286, issn 0302-9743, isbn 3-540-26179-6, 12 p.Conference Paper

  • Page / 45