A DECISION PROCEDURE USING DISCRETE GEOMETRYHERMAN GT; JACKOWSKI JA.1973; DISCRETE MATH.; NETHERL.; DA. 1973; VOL. 5; NO 2; PP. 131-144; BIBL. 10 REF.Serial Issue

ON THE STRUCTURE OF POLYNOMIAL TIME REDUCIBILITY.LADNER RE.1975; J. ASS. COMPTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 1; PP. 155-171; BIBL. 25 REF.Article

MINIMALE UND OPTIMALE BLUMSCHE MASSE. = MESURES DE BLUM MINIMALES ET OPTIMALESWECHSUNG G.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 673-679; ABS. ANGL. RUSSE; BIBL. 8 REF.; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974)Conference Paper

PERIODICITY IN GENERATIONS OF AUTOMATA. = PERIODICITE DANS DES GENERATIONS D'AUTOMATESCASE J.1974; MATH. SYST. THEORY; U.S.A.; DA. 1974; VOL. 8; NO 1; PP. 15-32; BIBL. 1 P.Article

THE REPRESENTATION OF MANY-ONE DEGREES BY DECISION PROBLEMS OF TURING MACHINESOVERBEEK R.1973; PROC. LONDON MATH. SOC.; G.B.; DA. 1973; VOL. 26; NO 1; PP. 167-183; BIBL. 4 REF.Serial Issue

UNIVERSELLE TURINGMASCHINEN MIT N-DIMENSIONALEM BAND. = MACHINES DE TURING UNIVERSELLES AVEC UNE BANDE A N DIMENSIONSWAGNER K.1973; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1973; VOL. 9; NO 7-8; PP. 423-431; ABS. ANGL. RUSSE; BIBL. 6 REF.Article

A NOTE ON MAXWELL'S DEMON AND UNIVERSAL COMPUTATION.LAING R.1973; J. CYBERN.; U.S.A.; DA. 1973; VOL. 3; NO 2; PP. 76-78; BIBL. 3 REF.Article

Probabilistic turing machines and recursively enumerable dedekind cutsCHROBAK, M; CHLEBUS, B. S.Information processing letters. 1984, Vol 19, Num 4, pp 167-171, issn 0020-0190Article

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

SUR LES MACHINES DE TURING UNIVERSELLES MINIMALESKARMAZIN VN.1976; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1976; NO 2; PP. 139-140; ABS. ANGL.; BIBL. 6 REF.Article

EINE UNIVERSELLE TURINGMASCHINE MIT ZWEIDIMENSIONALEM BAND, 7 BUCHSTABEN UND 2 ZUSTAENDEN. = UNE MACHINE DE TURING UNIVERSELLE A DEUX ETATS ET SEPT SYMBOLES AVEC UNE BANDE A DEUX DIMENSIONSOTTMANN T.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 1-2; PP. 27-38; ABS. ANGL. RUSSE; BIBL. 5 REF.Article

REMARK ON THE COMPUTATIONAL POWER OF A TURING MACHINE VARIANT.DEIMEL LE JR.1974; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1974; VOL. 3; NO 2; PP. 43-45; BIBL. 2 REF.Article

A MODEL FOR ITERATIVE COMPUTATIONTSICHRITZIS D.1973; INFORM. SCI.; U.S.A.; DA. 1973; VOL. 5; PP. 187-197; BIBL. 7 REF.Serial Issue

ALCANCES Y LMITES DE LA MECANIZACON EN LOGICA = BUTS ET LIMITES DU TRAITEMENT AUTOMATIQUE EN LOGIQUERAGGIO A.1970; REV. UNIV. NACION. CORDOBA; ARGENT.; DA. 1970; VOL. 11; NO 1-5; PP. 59-79; BIBL. 3 REF.Serial Issue

COMPARISONS AND RESET MACHINES.BOOK RV; GREIBACH SA; WRATHALL C et al.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 113-124; BIBL. 11 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

IN PRAISE OF ROBOTS.SAGAN C.1975; COMPUTERS AND PEOPLE; U.S.A.; DA. 1975; VOL. 24; NO 5; PP. 8-12Article

ON TURING MACHINES WITH VARIABLE STRUCTURE.VOLLMAR R.1975; INFORM. SCI.; U.S.A.; DA. 1975; VOL. 8; NO 3; PP. 259-270; BIBL. 3 REF.Article

THE HALTING PROBLEM FOR LINEAR TURING ASSEMBLERS.BAER RM; VAN LEEUWEN J.1975; STICHTG MATH. CENTRUM, INFORMAT.; NEDERL.; DA. 1975; NO 42; PP. 1-26; BIBL. 10 REF.Article

A DECISION PROCEDURE USING THE GEOMETRY OF CONVEX SETS.AITCHISON PW; HERMAN GT.1974; MATHEMATIKA; G.B.; DA. 1974; VOL. 21; NO 2; PP. 199-206; BIBL. 5 REF.Article

BORNE SUPERIEURE DE LA COMPLEXITE DE LA THEORIE DE IN MUNI DE LA RELATION DE DIVISIBILITEMICHEL P.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 890; PP. 242-250; BIBL. 1 REF.Conference Paper

ON DEGREES OF UNSOLVABILITY AND COMPLEXITY PROPERTIES.MARQUES I.1975; J. SYMBOL. LOGIC; U.S.A.; DA. 1975; VOL. 40; NO 4; PP. 529-540; BIBL. 8 REF.Article

SUR QUELQUES CARACTERISTIQUES SEMANTIQUES DES MACHINES DE TURINGYANOV YU I.1975; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1975; VOL. 224; NO 2; PP. 301-304; BIBL. 2 REF.Article

A CONVENIENT CRYPTOMORPHIC VERSION OF RECURSIVE FUNCTION THEORY.PRATHER RE.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 27; NO 2; PP. 178-195; BIBL. 9 REF.Article

REVERSAL-BOUNDED MULTIPUSHDOWN MACHINES.BAKER BS; BOOK RV.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 8; NO 3; PP. 315-332; BIBL. 19 REF.; (13TH ANNU. IEEE SYMP. SWITCHING AUTOM. THEORY; COLLEGE PARK, MD.; 1972)Conference Paper