نتائج البحث

Turing complete neural computation based on synaptic plasticity.

• Authors : Cabessa, Jérémie^1,2 (AUTHOR)

Subjects: *NEUROPLASTICITY; *RECURRENT neural networks; *TURING machines

• Source: PLoS ONE. 10/16/2019, Vol. 14 Issue 10, p1-34. 34p.

تفاصيل العنوان

CCS(25,12) is Turing-complete.

• Authors : Gorrieri, Roberto¹

• Source: Fundamenta Informaticae. 2017, Vol. 154 Issue 1-4, p145-166. 22p.

تفاصيل العنوان

Magic: The Gathering Is Turing Complete

• Authors : Churchill, Alex; Biderman, Stella; Herrick, Austin ...

Subjects: Turing machines; computability theory; Magic: the Gathering

تفاصيل العنوان

Univerzalni računski modeli ; Turing complete models

• Authors : PERČINIĆ, MARTIN; Robič, Borut

Subjects: univerzalni računski modeli; Turingovi stroji; sistemi oznak

تفاصيل العنوان

Tradeoffs in automated financial regulation of decentralized finance due to limits on mutable turing machines.

• Authors : Charoenwong, Ben; Kirby, Robert M.; Reiter, Jonathan

Subjects: TURING machines; LEGAL education; SECURITIES

• Source: Scientific Reports; 1/24/2025, Vol. 15 Issue 1, p1-18, 18p

تفاصيل العنوان

Quasi-delay-insensitive circuits are Turing-complete

• Authors : Rajit Manohar; Alain J. Martin; The Pennsylvania State University CiteSeerX Archives

Subjects: Quasi-delay-insensitive circuits; Turing machines; Determinism

• Source: http://csl.cornell.edu/~rajit/ps/qdi.ps.gz.

تفاصيل العنوان

MAQUINARIA EXPERIENCIAL E COMPUTABILIDADE.

• Authors : Lana de Carvalho, Leonardo

Subjects: TURING machines; ISOMORPHISM (Mathematics); MECHANICAL models

• Source: Síntese: Revista de Filosofia; set-dez2024, Vol. 51 Issue 161, p477-501, 25p

تفاصيل العنوان

Univerzalni računski modeli

• Authors : PERČINIĆ, MARTIN; Robič, Borut

Subjects: Turingovi stroji; cellular automata; univerzalni računski modeli

تفاصيل العنوان

Algorithmic Completeness of Imperative Programming Languages.

• Authors : Marquer, Yoann

Subjects: PROGRAMMING languages; COMPUTABLE functions; TURING machines

• Source: Fundamenta Informaticae; 2019, Vol. 168 Issue 1, p51-77, 27p

تفاصيل العنوان

SEPARATING COMPLEXITY CLASSES USING AUTOREDUCIBILITY.

• Authors : Buhrman, Harry; Fortnowt, Lance; Melkebeek, Dieter Van

Subjects: TURING machines; POLYNOMIALS; EXPONENTIAL functions

• Source: SIAM Journal on Computing; 2000, Vol. 29 Issue 5, p1497, 24p

تفاصيل العنوان