Entry Harrow:1978:HSS from sigcse1970.bib

Last update: Sun Apr 22 02:03:34 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Harrow:1978:HSS,
  author =       "Keith Harrow",
  title =        "How to show something is not: Proofs in formal
                 language and computability theory",
  journal =      j-SIGCSE,
  volume =       "10",
  number =       "3",
  pages =        "27--30",
  month =        aug,
  year =         "1978",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/953028.804227",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sun Nov 18 07:38:06 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1970.bib",
  note =         "Proceedings of the 9th SIGCSE symposium on Computer
                 science education.",
  abstract =     "Most introductory courses in theoretical computer
                 science (formal language theory or computability
                 theory) start with a seemingly endless series of
                 definitions, including what it means for a grammar or
                 language to be regular, context-free, etc., or what it
                 means for a function to be recursive, primitive
                 recursive, or partial recursive. Bright students
                 immediately ask two questions. First, what are examples
                 of languages or functions that belong to one class but
                 not the other? Second, is some particular language
                 context-free, or is a particular function recursive? We
                 must develop new techniques which allow us to give a
                 negative answer to question two (and thus to answer
                 question one as well). In this note we will discuss
                 some of the methods that are often used in elementary
                 proofs in formal language theory and computability
                 theory.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries