Skip to main content
Computer Science
fade2black's user avatar
fade2black's user avatar
fade2black's user avatar
fade2black
  • Member for 7 years, 6 months
  • Last seen more than a week ago
  • Berlin, Germany
Profile Activity

2,092 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
reviewed
Approve
How many possible policies in a Markov Decision Process?
reviewed
Close
Can a CD disk and the memory of a device have an infinite space storage?
comment
Show that maximum disjoint set problem is NP Complete
You should answer your own question instead of editing.
reviewed
Close
What is the exact definition of undirected graph, directed graph, unidirectional graph, bidirectional graph?
reviewed
Leave Open
What is the relation between countability and recursive enumeration?
revised
What is the relation between countability and recursive enumeration?
added 6 characters in body
reviewed
Close
Is this a standard representation of a 'space' character?
answered
What is the relation between countability and recursive enumeration?
reviewed
Close
How memory remapping of physical address space that is above 4GB RAM works?
revised
Why is writing down mathematical proofs more fault-proof than writing computer code?
edited body
answered
in a graph G= (V,E), finding a clique of size |V|- d where d is some constant
reviewed
Close
Why is writing down mathematical proofs more fault-proof than writing computer code?
reviewed
Close
Traveling Salesman Solution
reviewed
Close
size of a variable
reviewed
Close
What are some constant time operations?
revised
Decidability of whether a language described by Turing machine is regular
edited tags
answered
Decidability of whether a language described by Turing machine is regular
comment
Decidability of whether a language described by Turing machine is regular
"...given Turing machine". So, I guess the language is $\{\langle M \rangle \mid L(M) \text{ is regular } \}$. Your input is a TM.
comment
Decidability of whether a language described by Turing machine is regular
Could you add in your post what is the source of your problem? (Textbook, lecture notes, etc.)
comment
Decidability of whether a language described by Turing machine is regular
"The language would be encoded as Finite automaton". Finite automata would "encode" only regular languages. How would you encode non-regular languages? Non-CF, non-r.e languages? But as far as I understand your decider takes any language and decides if that language is regular, right?
1
…
6 7
8
9 10
…
105