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

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

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

Three small Universal Turing MachinesBAIOCCHI, Claudio.Lecture notes in computer science. 2001, pp 1-10, issn 0302-9743, isbn 3-540-42121-1Conference Paper

Representing the knowledge of Turing machinesHYUN SONG SHIN; WILLIAMSON, T.Theory and decision. 1994, Vol 37, Num 1, pp 125-146, issn 0040-5833Article

A note on multi-inkdot nondeterministic Turing machines with small spaceINOUE, K; ITO, A; TAKANAMI, I et al.Information processing letters. 1993, Vol 48, Num 6, pp 285-288, issn 0020-0190Article

The undecidability of the semi-unification problemKFOURY, A. J; TIURYN, J; URZYCZYN, P et al.Information and computation (Print). 1993, Vol 102, Num 1, pp 83-101, issn 0890-5401Article

Wittgenstein versus Turing on the nature of Church's thesisSHANKER, S. G.Notre Dame journal of formal logic. 1987, Vol 28, Num 4, pp 615-649, issn 0029-4527Article

Des modèles de nature différente peuvent approcher une même réalité : Longo : Laplace, Turing et le jeu de l'imitation = Different kinds of models can approximate the same reality : Longo: Laplace, Turing and the imitation gameKAYSER, Daniel.Intellectica (Orsay.1985). 2002, Num 35, pp 175-177, issn 0769-4113, 3 p.Article

An embryonics implementation of a self-replicating universal Turing machineRESTREPO, Hector Fabio; MANGE, Daniel.Lecture notes in computer science. 2001, pp 74-87, issn 0302-9743, isbn 3-540-42671-XConference Paper

A universal reactive machineANDERSEN, H. R; MØRK, S; SØRENSEN, M. U et al.Lecture notes in computer science. 1997, pp 89-103, issn 0302-9743, isbn 3-540-63141-0Conference Paper

A circuit-based proof of Toda's theoremKANNAN, R; VENKATESWARAN, H; VINAY, V et al.Information and computation (Print). 1993, Vol 104, Num 2, pp 271-276, issn 0890-5401Article

The complexity of matrix transposition on one-tape off-line Turing machines with cutput tapeDIETZFELBINGER, M; MAASS, W.Theoretical computer science. 1993, Vol 108, Num 2, pp 271-290, issn 0304-3975Article

On the power of several queuesHÜHNE, M.Theoretical computer science. 1993, Vol 113, Num 1, pp 75-91, issn 0304-3975Conference Paper

Minimal degrees for polynomial reducibilitiesHOMER, S.Journal of the Association for Computing Machinery. 1987, Vol 34, Num 2, pp 480-491, issn 0004-5411Article

The concept of computabilityCLELAND, Carol E.Theoretical computer science. 2004, Vol 317, Num 1-3, pp 209-225, issn 0304-3975, 17 p.Article

Page / 31