List Question
10 TechQA 2025-01-07 14:19:12Ways to measure bit sequence complexity
216 views
Asked by Psyche
Does there exist a TM for all countable languages?
998 views
Asked by Þorvaldur Rúnarsson
Turing Machines and Lambda Calculus equivalence
1.5k views
Asked by Greg Peckory
Is poly-time functions class recursively enumerable?
551 views
Asked by Saiiiira
What is the "trick" to writing a Quine?
11.4k views
Asked by calebds
program to reproduce itself and be useful -- not a quine
293 views
Asked by Ben
NP optimization problems (definition)
411 views
Asked by Belgi
Recursively enumerable (computably enumerable) languages closed under permutation?
531 views
Asked by user3688391
Proving the inexpressibility of a function in a given language
87 views
Asked by Ben
What does it mean to pass the machine and it's description as the input in the halting problem?
48 views
Asked by sayantan dasgupta