Jump to content

Wikipedia:WikiProject Mathematics/PlanetMath Exchange/68-XX Computer science

Add links
From Wikipedia, the free encyclopedia
< Wikipedia:WikiProject Mathematics | PlanetMath Exchange
This is an old revision of this page, as edited by CryptoDerk (talk | contribs) at 00:19, 5 February 2005 (→68Q30 Algorithmic information theory (Kolmogorov complexity, etc.): Kolmogorov complexity upper bounds). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

This page provides a list of all articles available at PlanetMath in the following topic:

68-XX Computer science.

This list will be periodically updated. Each entry in the list has three fields:

  1. PM : The first field is the link to the PlanetMath article, along with the article's object ID.
  2. WP : The second field is either a "guessed" link to a correspondingly named Wikipedia article, produced by the script which generated the list, or one or more manually entered links to the corresponding Wikipedia articles on the subject.
  3. Status : The third field is the status field, which explains the current status of the entry. The recommended status entries are:
Status means PM article
N not needed
A adequately covered
C copied
M merged
NC needs copying
NM needs merging
  • Please update the WP and Status fields as appropriate.
  • if the WP field is correct please remove the qualifier "guess".
  • If the corresponding Wikipedia article exists, but the link to it is wrong, please fix the link.
  • If you copy or merge an article from PlanetMath, please update the WP and Status fields for that entry.
  • If you have any comments, for example, thoughts on how the PlanetMath article compares to the corresponding Wikipedia article(s), please place such comments on a new indented line following the entry. Comments of this kind are very valuable.

Don't forget to include the relevant template if you copy over text or feel like an external link is warranted

  • {{planetmath|id=|title=}} for copied over text
  • {{planetmath reference|id=|title=}} for an external link

See the main page for examples and usage criteria.

One can use the web-based program Pmform to convert PlanetMath articles to the Wikipedia format. As a side benefit, this tool will place the PlanetMath template for you.

68M20 Performance evaluation; queueing; scheduling

68N18 Functional programming and lambda calculus

See 03B40 Combinatory logic and lambda-calculus

68P05 Data structures

See 05C05 Trees
  • PM: heap, id=2707 -- WP guess: heap -- Status:

68P10 Searching and sorting

See 05C05 Trees
See 05C05 Trees
See 68P05 Data structures
  • PM: hashing, id=3326 -- Duplicate entry.
See 68P05 Data structures
  • PM: heap, id=2707 -- Duplicate entry.
See 68P05 Data structures
See 68P05 Data structures
See 68P05 Data structures

68P20 Information storage and retrieval

See 05C05 Trees
See 05C05 Trees
See 68P05 Data structures
  • PM: hashing, id=3326 -- Duplicate entry.
See 68P05 Data structures
  • PM: heap, id=2707 -- Duplicate entry.
See 68P05 Data structures
See 68P05 Data structures
See 68P05 Data structures
See 60E05 Distributions: general theory
  • PM: trie, id=2684 -- Duplicate entry.
See 05C05 Trees
See 60E05 Distributions: general theory

68P30 Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.)

See 05C45 Eulerian and Hamiltonian graphs
See 68P10 Searching and sorting

68Q01 General

68Q05 Models of computation (Turing machines, etc.)

See 03D25 Recursively (computably) enumerable sets and degrees
See 03D10 Turing machines and related notions
See 03D10 Turing machines and related notions
See 03D10 Turing machines and related notions
See 03D10 Turing machines and related notions
See 03D10 Turing machines and related notions

68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

See 68Q05 Models of computation (Turing machines, etc.)
See 68Q05 Models of computation (Turing machines, etc.)
See 68Q05 Models of computation (Turing machines, etc.)
See 68Q05 Models of computation (Turing machines, etc.)
See 03D10 Turing machines and related notions

68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.)

68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

See 03F20 Complexity of proofs

68Q25 Analysis of algorithms and problem complexity

See 30E15 Asymptotic representations in the complex domain

68Q30 Algorithmic information theory (Kolmogorov complexity, etc.)

See 60A99 Miscellaneous
CryptoDerk 00:15, Feb 5, 2005 (UTC)
CryptoDerk 00:18, Feb 5, 2005 (UTC)
CryptoDerk 00:19, Feb 5, 2005 (UTC)
CryptoDerk 00:11, Feb 5, 2005 (UTC)
CryptoDerk 00:06, Feb 5, 2005 (UTC)
See 60A99 Miscellaneous
This is a bit more formal of a definition than I've seen before... perhaps it should be merged, I'm just not sure where. Also "pseudorandom" is spelled wrong, so watch out.
  • PM: support, id=3447 -- Duplicate entry.
See 60A99 Miscellaneous

68Q42 Grammars and rewriting systems

Although you have to go to several articles such as formal grammar, BNF, pushdown automaton, etc. we cover all this, and it's divided up into the appropriate articles here. CryptoDerk 23:54, Feb 4, 2005 (UTC)
See 03D10 Turing machines and related notions
See 03D10 Turing machines and related notions
See 03D10 Turing machines and related notions
CryptoDerk 19:13, Feb 3, 2005 (UTC)

68Q45 Formal languages and automata

See 03D05 Automata and formal grammars in connection with logical questions
See 68Q42 Grammars and rewriting systems
CryptoDerk 18:56, Feb 3, 2005 (UTC)
See 68Q42 Grammars and rewriting systems

68Q70 Algebraic theory of languages and automata

See 68Q45 Formal languages and automata
See 20M35 Semigroups in automata theory, linguistics, etc.
See 20M35 Semigroups in automata theory, linguistics, etc.
  • PM: monad, id=2614 -- Duplicate entry.
See 18C15 Triples (= standard construction, monad or triad), algebras for a triple, homology and derived functors for triples
See 20M35 Semigroups in automata theory, linguistics, etc.

68R05 Combinatorics

See 03F20 Complexity of proofs

68R10 Graph theory

Not very notable... something partially stemming from the work that came out of the construction of PM. CryptoDerk 21:50, Feb 3, 2005 (UTC)
CryptoDerk 18:14, Feb 3, 2005 (UTC)
CryptoDerk 18:14, Feb 3, 2005 (UTC)
See 05C38 Paths and cycles

68R15 Combinatorics on words

See 68Q45 Formal languages and automata

68T10 Pattern recognition, speech recognition

Article on PM has some problems, as well as an image that doesn't exist. Theirs goes into a bit more detail, mathematically, but ours explains it better conceptually. I'd say if they get their example fixed, we could merge it in, but until then ours is fine. CryptoDerk 23:50, Feb 4, 2005 (UTC)

68U05 Computer graphics; computational geometry

See 05B99 Miscellaneous
See 05B99 Miscellaneous

68U10 Image processing

CryptoDerk 17:59, Feb 3, 2005 (UTC)
See 68T10 Pattern recognition, speech recognition

68W01 General

See 13P05 Polynomials, factorization

68W10 Parallel algorithms

CryptoDerk 17:45, Feb 3, 2005 (UTC)

68W30 Symbolic computation and algebraic computation

See 11Y40 Algebraic number theory computations

68W40 Analysis of algorithms

  • PM: speedup, id=1132 -- Duplicate entry.
See 68W10 Parallel algorithms

68W99 Miscellaneous

See 11Z05 Miscellaneous applications of number theory
Retrieved from "https://en.wikipedia.org/w/index.php?title=Wikipedia:WikiProject_Mathematics/PlanetMath_Exchange/68-XX_Computer_science&oldid=9952917"