The periodic domino problem revisitedJEANDEL, Emmanuel.Theoretical computer science. 2010, Vol 411, Num 44-46, pp 4010-4016, issn 0304-3975, 7 p.Article

Two undecidable variants of Collatz's problemsLEHTONEN, Eero.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 596-600, issn 0304-3975, 5 p.Article

Undecidability in the homomorphic quasiorder of finite labeled forestsKUDINOV, Oleg V; SELIVANOV, Victor L.Lecture notes in computer science. 2006, pp 289-296, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 8 p.Conference Paper

New formally undecidable propositions : non-trivial lower bounds on proof complexity and related theoremsLUCKHARDT, H.Theoretical computer science. 1991, Vol 83, Num 2, pp 169-188, issn 0304-3975, 20 p.Article

The domino problem of the hyperbolic plane is undecidableMARGENSTERN, Maurice.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 29-84, issn 0304-3975, 56 p.Article

The 4-way deterministic tiling problem is undecidableLUKKARILA, Ville.Theoretical computer science. 2009, Vol 410, Num 16, pp 1516-1533, issn 0304-3975, 18 p.Article

From sandpiles to sand automataCERVELLE, Julien; FORMENTI, Enrico; MASSON, Benoit et al.Theoretical computer science. 2007, Vol 381, Num 1-3, pp 1-28, issn 0304-3975, 28 p.Article

The disabled body, genealogy and undecidabilitySHILDRICK, Margrit.Cultural studies. 2005, Vol 19, Num 6, pp 755-770, issn 0950-2386, 16 p.Article

The surjectivity problem for 2D cellular automataDURAND, B.Journal of computer and system sciences (Print). 1994, Vol 49, Num 3, pp 718-725, issn 0022-0000Article

Rearticulating the Concept of Experience, Rethinking the Demands of DeconstructionGORMLEY, Steven.Research in phenomenology. 2012, Vol 42, Num 3, pp 374-407, issn 0085-5553, 34 p.Article

Entscheidbarkeit und SemiosisBOGARIN, J.Semiosis (Baden-Baden). 1989, Vol 14, Num 53, pp 17-32, issn 0170-219XArticle

On the decidability of self-assembly of infinite ribbonsADLEMAN, Leonard; KARI, Jarkko; KARI, Lila et al.Annual Symposium on Foundations of Computer Science. 2002, pp 530-537, isbn 0-7695-1822-2, 8 p.Conference Paper

A theory of mathematical correctness and mathematical truth = Une théorie de l'exactitude et de la vérité mathématiquesBALAGUER, Mark.Pacific philosophical quarterly. 2001, Vol 82, Num 2, pp 87-114, issn 0279-0750Article

Sur le statut logique de l'assertion co-NP=NP = On the logical status of the co-NP¬=;NP assertionFOUKS, J.-D.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1991, Vol 313, Num 13, pp 947-950, issn 0764-4442Article

Sovereignty and the UFOWENDT, Alexander; DUVALL, Raymond.Political theory. 2008, Vol 36, Num 4, pp 607-633, issn 0090-5917, 27 p.Article

Self-assembly of infinite structures: A surveyPATITZ, Matthew J; SUMMERS, Scott M.Theoretical computer science. 2011, Vol 412, Num 1-2, pp 159-165, issn 0304-3975, 7 p.Article

A uniform method for proving lower bounds on the computational complexity of logical theoriesCOMPTON, K. J; WARD HENSON, C.Annals of pure and applied logic. 1990, Vol 48, Num 1, pp 1-79, issn 0168-0072, 79 p.Article

New results on the computability and complexity of points - to - analysisCHAKARAVARTHY, Venkatesan T.ACM SIGPLAN notices. 2003, Vol 38, Num 1, pp 115-125, issn 1523-2867, 11 p.Conference Paper

An undecidability result concerning periodic morphismsHALAVA, Vesa; HARJU, Tero.Lecture notes in computer science. 2002, pp 304-310, issn 0302-9743, isbn 3-540-43453-4Conference Paper

Sand automata as cellular automataDENNUNZIO, Alberto; GUILLON, Pierre; MASSON, Benoît et al.Theoretical computer science. 2009, Vol 410, Num 38-40, pp 3962-3974, issn 0304-3975, 13 p.Article

Post Correspondence Problem for short wordsHALAVA, Vesa; HARJU, Tero; HIRVENSALO, Mika et al.Information processing letters. 2008, Vol 108, Num 3, pp 115-118, issn 0020-0190, 4 p.Article

Type checking and typability in domain-free lambda calculiNAKAZAWA, Koji; TATSUTA, Makoto; KAMEYAMA, Yukiyoshi et al.Theoretical computer science. 2011, Vol 412, Num 44, pp 6193-6207, issn 0304-3975, 15 p.Article

Playing with Conway's problemJEANDEL, Emmanuel; OLLINGER, Nicolas.Theoretical computer science. 2008, Vol 409, Num 3, pp 557-564, issn 0304-3975, 8 p.Article

Finite sets of words and computing : (A Survey)KARHUMÄKI, Juhani.Lecture notes in computer science. 2005, pp 36-49, issn 0302-9743, isbn 3-540-25261-4, 14 p.Conference Paper

Some open problems in decidability of brick (labelled polyomino) codesMOCZURAD, Małgorzata; MOCZURAD, Włodzimierz.Lecture notes in computer science. 2004, pp 72-81, issn 0302-9743, isbn 3-540-22856-X, 10 p.Conference Paper