CZ:Core Articles/Computers: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>John Stephenson
(copy of core articles list, formatted)
 
imported>John Stephenson
(-done)
 
Line 1: Line 1:
{{col-begin}}
{{col-begin}}
{{col-break|width=33%}}
{{col-break}}
===Highest priority===
{{rpl|Linked list}}
{{rpl|Regular Language}}
{{rpl|Turing Machine}} **
{{rpl|Interpreter (computer)}}
{{rpl|Virtual memory}}
 
===High priority===
===High priority===
{{rpl|Halting problem}}
{{rpl|Database}}
{{rpl|Threading}}
{{rpl|Threading}}
{{rpl|Liquid Crystal Display}}
{{rpl|Liquid Crystal Display}}
{{rpl|Data types}} includes static vs. dynamic, mention of inference, and other appropriate parts of Wikipedia's [[Data types}}, [[Type system}} and [[Type theory}}
{{rpl|Data types}} includes static vs. dynamic, mention of inference, and other appropriate parts of Wikipedia's [[Data types]], [[Type system]] and [[Type theory]]
{{rpl|Floating point}}
{{rpl|Floating point}}
{{rpl|Machine learning}}
{{rpl|Software testing}}
{{rpl|Software testing}}
{{rpl|String (computing)}}
{{rpl|Two's complement}}


===Mid-priority===
===Mid-priority===
Line 30: Line 18:
{{rpl|Cache}}
{{rpl|Cache}}
{{rpl|Process}} in the context of an operating system
{{rpl|Process}} in the context of an operating system
{{rpl|Structured Query Language}}
{{rpl|Computer Keyboard}}
{{rpl|Computer Keyboard}}
{{rpl|Computer Mouse}}
{{rpl|Computer Mouse}}
{{rpl|Hard disk}}
{{rpl|Abstract data type}}
{{rpl|Abstract data type}}
{{rpl|Alan Turing}}
{{rpl|ACM}}
{{rpl|ACM}}
{{rpl|EFI}}
{{rpl|EFI}}
{{rpl|Turing Award}}
{{rpl|Turing Award}}
{{col-break}}


{{col-break|width=33%}}
===Theory, algorithms, data structures and Languages===
===Theory, algorithms, data structures and Languages===
{{rpl|B-Tree}}
{{rpl|B-Tree}}
Line 51: Line 36:
{{rpl|Fast Fourier transform}}
{{rpl|Fast Fourier transform}}
{{rpl|Huffman code}}
{{rpl|Huffman code}}
{{rpl|Lambda calculus}}
{{rpl|Minimum spanning tree}}
{{rpl|Minimum spanning tree}}
{{rpl|Min cut and max flow}}
{{rpl|Min cut and max flow}}
{{rpl|Monte Carlo algorithm}}
{{rpl|Monte Carlo algorithm}}
{{rpl|Order statistics (algorithms)}} i.e. median
{{rpl|Order statistics (algorithms)}} i.e. median
{{rpl|Recurrence relation}}
{{rpl|Relational algebra}}
{{rpl|Relational algebra}}
{{rpl|Shortest path}} (includes Dijkstra's algorithm)
{{rpl|Shortest path}} (includes Dijkstra's algorithm)
Line 64: Line 47:
{{rpl|Forth programming language}}
{{rpl|Forth programming language}}
{{rpl|Fortran programming language}}
{{rpl|Fortran programming language}}
{{rpl|Haskell programming language}}
{{rpl|ML programming language}}
{{rpl|ML programming language}}
{{rpl|Object oriented}} in the context of programming languages
{{rpl|Object oriented}} in the context of programming languages
{{rpl|Prolog programming language}}
{{rpl|Prolog programming language}}
{{rpl|Type inference}}
{{rpl|Type inference}}
{{rpl|ASCII}}
{{rpl|Bit}} (or should that be redirect to [[Binary numeral system]]?)
{{rpl|Bit}} (or should that be redirect to [[Binary numeral system}}?)
{{rpl|Capatcha}}
{{rpl|Capatcha}}
{{rpl|Computational Biology}}
{{rpl|Computational Biology}}
{{rpl|Computer program}}
{{rpl|Linear programming}}
{{rpl|Linear programming}}


{{col-break|width=33%}}
===Systems, networking, and misc===
===Systems, networking, and misc===
{{rpl|Computer vision}}
{{rpl|Computer vision}}
{{rpl|Geometric computing}} **
{{rpl|GNU Public License|GPL}}
{{rpl|GNU Public License|GPL}}
{{rpl|Grid computing}}
{{rpl|Grid computing}}
{{rpl|Software standards}}
{{rpl|Software standards}}
{{rpl|Software verification}}
{{rpl|Software verification}}
{{rpl|Unicode}}
{{rpl|Bandwidth}}
{{rpl|Throughput}}
{{rpl|Throughput}}
{{rpl|File Transfer Protocol}}
{{rpl|Computer virus}}
{{rpl|Latency}}
{{rpl|Computer Virus}}
{{rpl|Ethernet}}
{{rpl|Graphical User Interface}}
{{rpl|Graphical User Interface}}
{{rpl|Lock (computing)}}
{{rpl|Lock (computing)}}
Line 97: Line 70:
{{rpl|Transactional memory}}
{{rpl|Transactional memory}}
{{rpl|Universal Serial Bus}} a.k.a. USB
{{rpl|Universal Serial Bus}} a.k.a. USB
{{rpl|Random Access Memory}}
{{rpl|Wireless Networking}}
{{rpl|Wireless Networking}}
{{rpl|Cathode Ray Tube}}
{{rpl|Cathode Ray Tube}}
{{rpl|Memory management unit}}
{{rpl|Memory management unit}}
{{rpl|ANSI}}
{{rpl|ANSI}}
{{rpl|IEEE}}
{{rpl|IETF}}
{{rpl|IETF}}
{{rpl|ISO}}
{{rpl|ISO}}
Line 110: Line 81:
{{rpl|Kurt Goedel}}
{{rpl|Kurt Goedel}}
{{rpl|Richard Karp}}
{{rpl|Richard Karp}}
{{rpl|Robert Tarjan}}
{{col-end}}


===Not quite important enough?===
===Not quite important enough?===
{{col-begin}}
{{col-break|width=33%}}
{{rpl|Simple Mail Transfer Protocol}}
#several topics to consider at [[List of topics in software engineering]]
#several topics to consider at [[List of topics in software engineering]]
#<small>''People''</small> [[Ada Lovelace]]
#<small>''People''</small> [[Ada Lovelace]]
Line 124: Line 89:
#<small>''Theory''</small> [[Probabilistically checkable proof]] PCP theorem is important for current research, but maybe not top-100 [[User:Warren Schudy|Warren Schudy]] 20:22, 8 January 2008 (CST)
#<small>''Theory''</small> [[Probabilistically checkable proof]] PCP theorem is important for current research, but maybe not top-100 [[User:Warren Schudy|Warren Schudy]] 20:22, 8 January 2008 (CST)
# standards organizations: , [[WS-I]], etc.
# standards organizations: , [[WS-I]], etc.
#<small>''Languages''</small> [[Erlang programming language]]
#<small>''Languages''</small> [[OCaml programming language]]
#<small>''Languages''</small> [[OCaml programming language]]
#<small>''Systems''</small> [[Microprocessor]] (we already have [[CPU]])
#<small>''Data''</small> [[Fibonacci heap]]
#<small>''Data''</small> [[Fibonacci heap]]
#<small>''Theory''</small> [[Graph theory]] (important, but removed from here because it's in the math list. If math removes it from theirs, we should add it back to ours.)
{{col-end}}
{{col-end}}

Latest revision as of 12:02, 1 November 2014

High priority

Mid-priority

Theory, algorithms, data structures and Languages

Systems, networking, and misc

Not quite important enough?

  1. several topics to consider at List of topics in software engineering
  2. People Ada Lovelace
  3. The Anti-Kythera Mechanism Is this really important enough? Warren Schudy 20:22, 8 January 2008 (CST)
  4. Theory Planar Graph Probably not important enough Warren Schudy 18:35, 8 January 2008 (CST)
  5. Theory Probabilistically checkable proof PCP theorem is important for current research, but maybe not top-100 Warren Schudy 20:22, 8 January 2008 (CST)
  6. standards organizations: , WS-I, etc.
  7. Languages OCaml programming language
  8. Data Fibonacci heap

  1. ACM Turing Awards sorted by year. Last access 8/10/2020