Time complexity of a language whose alphabet has a single symbol

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
2
down vote

favorite












Consider a language $L$ such that $L subseteq Sigma^*$, where the cardinality of $Sigma$ is $1$ (i.e. the alphabet has only one symbol). E.g. $L subseteq a^*$.



Can anything be said about the time complexity of $L$? Is it the case that $L in P$?



I can't come up with any example of a language with a single symbol that is not in $P$.






time-complexity decision-problem







share|cite|improve this question

























    up vote
    2
    down vote

    favorite












    Consider a language $L$ such that $L subseteq Sigma^*$, where the cardinality of $Sigma$ is $1$ (i.e. the alphabet has only one symbol). E.g. $L subseteq a^*$.



    Can anything be said about the time complexity of $L$? Is it the case that $L in P$?



    I can't come up with any example of a language with a single symbol that is not in $P$.






    time-complexity decision-problem







    share|cite|improve this question























      up vote
      2
      down vote

      favorite









      up vote
      2
      down vote

      favorite











      Consider a language $L$ such that $L subseteq Sigma^*$, where the cardinality of $Sigma$ is $1$ (i.e. the alphabet has only one symbol). E.g. $L subseteq a^*$.



      Can anything be said about the time complexity of $L$? Is it the case that $L in P$?



      I can't come up with any example of a language with a single symbol that is not in $P$.






      time-complexity decision-problem







      share|cite|improve this question













      Consider a language $L$ such that $L subseteq Sigma^*$, where the cardinality of $Sigma$ is $1$ (i.e. the alphabet has only one symbol). E.g. $L subseteq a^*$.



      Can anything be said about the time complexity of $L$? Is it the case that $L in P$?



      I can't come up with any example of a language with a single symbol that is not in $P$.






      time-complexity decision-problem




      time-complexity decision-problem






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked 5 hours ago









      denidare

      182




      182




















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          3
          down vote













          The language $a^n : text the $n$th Turing machine halts on the empty string $ is undecidable.



          In fact, a random unary language is undecidable almost surely, for the simple reason that there are only countably many computable languages.






          share|cite|improve this answer




















          • Thanks, this makes sense. Would anything change if we restricted $L$ to be decidable?
            – denidare
            5 hours ago










          • Perhaps you can search a bit on the Internet. You might find things like "if there exists a unary language that is NP-complete, then P = NP" and other interesting observations.
            – Pål GD
            4 hours ago






          • 1




            Not really. You can ask whether the $n$th Turing machine halts within $T(n)$ steps on the empty string, which should be hard to determine given much less than $T(n)$ time.
            – Yuval Filmus
            4 hours ago










          Your Answer





          StackExchange.ifUsing("editor", function ()
          return StackExchange.using("mathjaxEditing", function ()
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          );
          );
          , "mathjax-editing");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "419"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          convertImagesToLinks: false,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          bindNavPrevention: true,
          postfix: "",
          imageUploader:
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          ,
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );













           

          draft saved


          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f99454%2ftime-complexity-of-a-language-whose-alphabet-has-a-single-symbol%23new-answer', 'question_page');

          );

          Post as a guest

















          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          3
          down vote













          The language $a^n : text the $n$th Turing machine halts on the empty string $ is undecidable.



          In fact, a random unary language is undecidable almost surely, for the simple reason that there are only countably many computable languages.






          share|cite|improve this answer




















          • Thanks, this makes sense. Would anything change if we restricted $L$ to be decidable?
            – denidare
            5 hours ago










          • Perhaps you can search a bit on the Internet. You might find things like "if there exists a unary language that is NP-complete, then P = NP" and other interesting observations.
            – Pål GD
            4 hours ago






          • 1




            Not really. You can ask whether the $n$th Turing machine halts within $T(n)$ steps on the empty string, which should be hard to determine given much less than $T(n)$ time.
            – Yuval Filmus
            4 hours ago














          up vote
          3
          down vote













          The language $a^n : text the $n$th Turing machine halts on the empty string $ is undecidable.



          In fact, a random unary language is undecidable almost surely, for the simple reason that there are only countably many computable languages.






          share|cite|improve this answer




















          • Thanks, this makes sense. Would anything change if we restricted $L$ to be decidable?
            – denidare
            5 hours ago










          • Perhaps you can search a bit on the Internet. You might find things like "if there exists a unary language that is NP-complete, then P = NP" and other interesting observations.
            – Pål GD
            4 hours ago






          • 1




            Not really. You can ask whether the $n$th Turing machine halts within $T(n)$ steps on the empty string, which should be hard to determine given much less than $T(n)$ time.
            – Yuval Filmus
            4 hours ago












          up vote
          3
          down vote










          up vote
          3
          down vote









          The language $a^n : text the $n$th Turing machine halts on the empty string $ is undecidable.



          In fact, a random unary language is undecidable almost surely, for the simple reason that there are only countably many computable languages.






          share|cite|improve this answer












          The language $a^n : text the $n$th Turing machine halts on the empty string $ is undecidable.



          In fact, a random unary language is undecidable almost surely, for the simple reason that there are only countably many computable languages.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 5 hours ago









          Yuval Filmus

          185k12176337




          185k12176337











          • Thanks, this makes sense. Would anything change if we restricted $L$ to be decidable?
            – denidare
            5 hours ago










          • Perhaps you can search a bit on the Internet. You might find things like "if there exists a unary language that is NP-complete, then P = NP" and other interesting observations.
            – Pål GD
            4 hours ago






          • 1




            Not really. You can ask whether the $n$th Turing machine halts within $T(n)$ steps on the empty string, which should be hard to determine given much less than $T(n)$ time.
            – Yuval Filmus
            4 hours ago
















          • Thanks, this makes sense. Would anything change if we restricted $L$ to be decidable?
            – denidare
            5 hours ago










          • Perhaps you can search a bit on the Internet. You might find things like "if there exists a unary language that is NP-complete, then P = NP" and other interesting observations.
            – Pål GD
            4 hours ago






          • 1




            Not really. You can ask whether the $n$th Turing machine halts within $T(n)$ steps on the empty string, which should be hard to determine given much less than $T(n)$ time.
            – Yuval Filmus
            4 hours ago















          Thanks, this makes sense. Would anything change if we restricted $L$ to be decidable?
          – denidare
          5 hours ago




          Thanks, this makes sense. Would anything change if we restricted $L$ to be decidable?
          – denidare
          5 hours ago












          Perhaps you can search a bit on the Internet. You might find things like "if there exists a unary language that is NP-complete, then P = NP" and other interesting observations.
          – Pål GD
          4 hours ago




          Perhaps you can search a bit on the Internet. You might find things like "if there exists a unary language that is NP-complete, then P = NP" and other interesting observations.
          – Pål GD
          4 hours ago




          1




          1




          Not really. You can ask whether the $n$th Turing machine halts within $T(n)$ steps on the empty string, which should be hard to determine given much less than $T(n)$ time.
          – Yuval Filmus
          4 hours ago




          Not really. You can ask whether the $n$th Turing machine halts within $T(n)$ steps on the empty string, which should be hard to determine given much less than $T(n)$ time.
          – Yuval Filmus
          4 hours ago

















           

          draft saved


          draft discarded















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f99454%2ftime-complexity-of-a-language-whose-alphabet-has-a-single-symbol%23new-answer', 'question_page');

          );

          Post as a guest
































































          -

          Popular posts from this blog

          How to check contact read email or not when send email to Individual?

          Image
          Clash Royale CLAN TAG #URR8PPP up vote 1 down vote favorite I'm using WordPress 4.9.8, CiviCRM to 5.5.1, I usually send email to contact by Search> Find contacts View contact details Action> Send email Send email ok, Contact received mail ok like picture But status only Email sent though contact read email or not. So, can CiviCRM can change status to Email read when contact read email? wordpress email share | improve this question asked Sep 26 at 0:12 ToanLuong 49 9 add a comment  |  up vote 1 down vote favorite I'm using WordPress 4.9.8, CiviCRM to 5.5.1, I usually send email to contact by Search> Find contacts View contact details Action> Send email Send email ok, Contact received mail ok like picture But status only Email sent though contact read email or not. So, can CiviCRM can change status to Email read when contact read email? wordpress email share | improve this question asked Se
          Read more

          Displaying single band from multi-band raster using QGIS

          Image
          Clash Royale CLAN TAG #URR8PPP 1 How can I extract a single band from multi-band raster in QGIS? I have an remote sensed image which has 6 bands (including NDVI band), I want to display each band separately, but have no idea how to do. I have seen some questions similar here but none worked for me. The original image (has 6 bands) is: I want to display the band 6 which should be like this: But I tried gdal_translate, and couldn't get the correct result. What I have got is: qgis raster multi-band share | improve this question edited Mar 5 at 0:53 Summer asked Mar 4 at 6:42 Summer Summer 23 6 Is this any help gis.stackexchange.com/questions/220658/… ? if not gis.stackexchange.com/questions/62133/… might help. – Michael Stimson Mar 4 at 6:46 Thanks for answering but when I used gdal_translate, qgis showed that 'Error 4: Kayena.tif: No such file or directory". Would you know how to fix it? –
          Read more

          How many registers does an x86_64 CPU actually have?

          Image
          Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite I am currently learning reverse engineering and am studying the flags register. I had in my mind that rflags was just another name for one of the 16 general purpose registers, for example rax or rbx . But it looks like rflags is actually an additional register. So that makes 17 registers in total... how many more could there be? I have spent at least an hour on this and found numerous different answers. The best answer so far is this, which says that there are 40 registers in total. 16 General Purpose Registers 2 Status Registers 6 Code Segment Registers 16 SSE Registers 8 FPU/MMX Registers But if I add that up, I get 48. Could anybody provide an official answer on how many registers an x86_64 CPU has (e.g. an Intel i7). Additionally, I have seen references to 'hardware' and 'architectural' registers. What are those registers and how many are there? register x86-64 share | improve this
          Read more