rafaeldff + computerscience   132

Computer Scientist's Trivia
Common latency numbers, binary notation tricks, some floating point hacks, etc. More distilled than encyclopedic.
performance  reference  trivia  ComputerScience  programming  systems  BitTwiddling  binary  FloatingPoint  latency 
february 2017 by rafaeldff
Revised Report on the Propagator Model
In the past year we have made serious progress on elaborating the propagator programming model [2,3]. Things have gotten serious enough to build a system that can be used for real experiments.

The most important problem facing a programmer is the revision of an existing program to extend it for some new situation. Unfortunately, the traditional models of programming provide little support for this activity. The programmer often finds that commitments made in the existing code impede the extension, but the costs of reversing those commitments are excessive.

Such commitments tend to take the form of choices of strategy. In the design of any significant system there are many implementation plans proposed for every component at every level of detail. However, in the system that is finally delivered this diversity of plans is lost and usually only one unified plan is adopted and implemented. As in an ecological system, the loss of diversity in the traditional engineering process has serious consequences.

The Propagator Programming Model is an attempt to mitigate this problem. It is a model that supports the expression and integration of multiple viewpoints on a design. It incorporates explicit structure to support the integration of redundant pieces and subsystems that solve problems in several different ways. It will help us integrate the diversity that was inherent in the design process into the delivered operational product.

The Propagator Programming Model is built on the idea that the basic computational elements are autonomous machines interconnected by shared cells through which they communicate. Each machine continuously examines the cells it is interested in, and adds information to some based on computations it can make from information from the others. Cells accumulate information from the propagators that produce that information. The key idea here is additivity. New ways to make contributions can be added just by adding new propagators; if an approach to a problem doesn't turn out to work well, it can be identified by its premises and ignored, dynamically and without disruption.

This work was supported in part by the MIT Mind Machine Project.
AlexeyRadul  GeraldJaySussman  GeraldSussman  Sussman  propagator  programming  ComputerScience  paper  Functionalprogramming  ConstraintProgramming  propagators 
january 2014 by rafaeldff
Great Works in Computer Science
Readings for a course on Great Works in Computer Science, by David Evans of University of Virginia.
toread  list  paper  papers  classic  catalog  ComputerScience  CS  DavidEvans 
january 2014 by rafaeldff
Quantum Computing Solves Classical Problems | Simons Foundation
Why quantum computing matters even if nobody ever build a non-trivial quantum computer:
quantum  QuantumComputing  QC  computing  computation  theory  CS  ComputerScience  from twitter_favs
december 2012 by rafaeldff
Bits of Evidence
Bits are too small a unit, I would prefer to see at least some bytes of evidence. I guess I'll have to wait for the O'Reilly book.
software  engineering  SE  softwareengineering  CS  computerscience  research  stats  empirical  evidence  talk  GregWilson  presentation  development  science  statistics  productivity 
october 2009 by rafaeldff
hatful of hollow - Visualising Sorting Algorithms
"Static visualizations of sorting algorithms (clearer than Sedgewick-style animations)"
visualization  algorithm  algorithms  sorting  CS  ComputerScience  graphic  AldoCortesi 
april 2009 by rafaeldff
Phil Windley's Technometria | Alan Kay: Is Computer Science an Oxymoron?
The following two paragraphs taken from a recent talk by Alan Kay (paraphrased by Phil Windley) represent quite closely how I've been thinking about Computer Science lately:

"Much of what is wrong about our field is that many of the ideas that happened before 1975 are still the current paradigm. He has a strong feeling that our field has been mired for some time, but because of Moore’s law, there are plenty of things to work on. The commercialization of personal computing was a tremendous distraction to our field and we haven’t, and may not, recover from it.

[in Computer Science] The basics are still mostly the same. If you go to most campuses, there is a single computer science department and the first course in computer science is almost indistinguishable from the first course in 1960. They’re about data structures and algorithms despite the fact that almost nothing exciting about computing today has to do with data structures and algorithms. "
AlanKay  talk  speech  computerscience  CS  history  academia  research  computing  blog  post  PhilWindley 
january 2009 by rafaeldff
Teaching Programming Languages in a Post-Linnaean Age
"Abstract: Programming language ``paradigms'' are a moribund and tedious legacy of a bygone age. Modern language designers pay them no respect, so why do our courses slavishly adhere to them? This paper argues that we should abandon this method of teaching languages, offers an alternative, reconciles an important split in programming language education, and describes a textbook that explores these matters."
paper  ShriramKrishnamurthi  programming  language  teaching  PL  paradigm  paradigms  computing  CS  computerscience  education  PLAI  toread 
august 2008 by rafaeldff
The Claremont Report on Database Research
"In late May, 2008, a group of database researchers, architects, users and pundits met [] to discuss the state of the research field and its impacts on practice. This was [] distinguished by a broad consensus that we are at a turning point in the history of the field, due both to an explosion of data and usage scenarios, and to major shifts in computing hardware and platforms. Given these forces, we are at a time of opportunity for research impact, with an unusually large potential for influential results across computing, the sciences and society. This report details that discussion, and highlights the group's consensus view of new focus areas, including new database engine architectures, declarative programming languages, the interplay of structured and unstructured data, cloud data services, and mobile and virtual worlds. "
paper  project  DB  data  database  research  CS  ComputerScience  analysis  future  report  DBMS  conference  berkeley  cleremont  trends 
august 2008 by rafaeldff
A Computational Introduction to Number Theory and Algebra
A book introducing basic concepts from computational number theory and algebra, including all the necessary mathematical background.
book  mathematics  cs  computerscience  Algebra  NumberTheory  free  online  VictorShoup  cryptography  theory  algorithms  reference 
may 2008 by rafaeldff
Mark Guzdial's Amazon Blog: The Psychology of Computer Science Lectures Permalink
"It is actually more learning-efficient for students to come to class and hear a teacher’s explanation (narration) while looking at code or diagrams or program execution. It will actually take students more time to learn the same things to read the []
blog  post  MarkGuzdial  teaching  CS  computerscience  lectures  narration  classroom  presence  cognition  psychology  CognitivePsychology  learning 
may 2008 by rafaeldff
Mark Guzdial's Amazon Blog: What should everyone study about computing? Permalink
I have a great quote from Richard Dawkins where he describes biology as a “branch of computer science” since Watson and Crick realized that DNA is basically digital information. -- QOTD
blog  post  MarkGuzdial  computing  computerscience  CS  teaching  education  edu 
april 2008 by rafaeldff
Computer Science Unplugged - Home
Great way to teach CS concepts to children. Have them learn error detection through card tricks, search algorithms by playing battleship, or sorting networks by running around.
site  teaching  education  CS  computerscience  computing  kids  children  programming  activity 
april 2008 by rafaeldff
Teaching, Playing, and Programming: In praise of mandatory indentation for novice programmers
Chirs Okasaki reports striking improvements to novice performance when a (custom) language with significant whitespace was used for teaching.
blog  post  ChrisOkasaki  teaching  programming  language  syntax  whitespace  indentation  academia  course  education  computerscience  casestudy  coding 
february 2008 by rafaeldff
Complexity Theory: A Modern Approach / Sanjeev Arora and Boaz Barak
This is a draft of a textbook on computational complexity theory. It is intended as a text for an advanced undergraduate course or introductory graduate course, or as a reference for researchers and students in computer science and allied fields such as m
book  online  free  computerscience  computing  complexity  theory  computation  ComplexityTheory  Princeton  course  SanjeevArora  BoazBarak  CS  textbook 
february 2008 by rafaeldff
Turbulent Intellect: Identity Crisis in Computer Science Education
A good summary about the current polemic over Computer Science education. Information technology is so prevalent in the world, that people forget the field is very young and growing pains are to be expected.
blog  post  ChrisAmmerman  CS  ComputerScience  programming  software  education  engineering  academia  academic  polemic 
february 2008 by rafaeldff
Handbook of Applied Cryptography
"CRC Press has generously given us permission to make all chapters available for free download. "
book  cryptography  online  free  security  CS  computerscience  pdf  reference  handbook 
december 2007 by rafaeldff
Overcoming Bias: Artificial Addition
"Suppose that human beings had absolutely no idea how they performed arithmetic. Imagine that human beings had evolved, rather than having learned, the ability to count..." The author then develops an insightful analogy to Aritificial Intelligence.
blog  post  AI  interesting  ArtificialIntelligence  CogSci  learning  philosophy  ComputerScience  CS  intelligence  arithmetic  analogy 
november 2007 by rafaeldff
An ABC of Category Theory
"This course is aimed at potential users of categorical ideas rather than aspiring category theorists. I will skip details wherever I can. There will not be many useful theorems in the course. Rather, the point is to teach you how to think categorically.
course  academic  mathematics  computerscience  CS  category  CategoryTheory  theory  formal  formalism  introduction  LectureNotes 
november 2007 by rafaeldff
Philosophy of Computer Science, University of Essex
Cool! Lots of bibliography and links to material on the Philosophy of Computer Science.
page  CS  ComputerScience  computing  philosophy  science  fundamentals  link  links  catalog  compendium  list 
november 2007 by rafaeldff
Colorization Using Optimization
Amazing. Sigh... This kind of thing just steals my will to hate Linear Programming. Did I mention it is amazing?
CG  CGI  color  colorization  research  CS  computerscience  graphics  imaging  processing  algorithm  LP  optimization  colors  media  video 
november 2007 by rafaeldff
Category Theory for the Java Programmer « reperiendi
"Java, on the other hand, is often used as an introductory language; while it was not designed with category theory in mind, there is a lot of category theory that passes over directly."
article  Java  CategoryTheory  Category  theory  mathematics  computerscience  CS  introduction  math 
november 2007 by rafaeldff
EWD 1305 - Answers to questions from students of Software Engineering
Dijkstra writing (in 2000) about the state of the software industry and education. As usual for a Dijkstra essay, lots of great quotes, many worthwhile insights, and just a touch of self-indulgent grumbling.
dijkstra  EdsgerDijkstra  EWD  EWD1305  letter  missive  column  opinion  essay  article  quotes  software  hardware  computing  computer  ComputerScience  engineering  education  pdf 
october 2007 by rafaeldff
PragDave: Art in Programming
"Software development is neither. Nor is it art. It's just software development. People who look for the "software is like xxx" analogies are missing the point. Software development is like software development. Let's decide what works for us, and have fu
blog  post  quote  PragDave  DaveThomas  programming  CS  ComputerScience  software  engineering  development  art 
october 2007 by rafaeldff
Binary Lambda Calculus and Combinatory Logic | Lambda the Ultimate
"the question of what is the smallest (as measured in binary bits) Turing Machine that can possibly be constructed. John Tromp provides an answer to this question in his always fun Lambda Calculus and Combinatory Logic Playground:"
LtU  thread  post  paper  ChrisRathman  JohnTromp  computerscience  computing  information  theory  complexity  LC  lambda  LambdaCalculus  calculus  calculi  Kolmogorov  KolmogorovComplexity  algorithm  InformationTheory  AIT  AlgorithmicInformationTheory  interpreter  language  Turing  TuringMachine  TM 
september 2007 by rafaeldff
Catfish in the Memepool: Thomas Jay Peckish II on the Role of Computer Science
"The role of a Computer Science Department should be to provide a forum for the study of its indigenous subject matter, code, bits, The Program, and not a permanent venue for the Special Olympics of mathematics... " (Brian Foote)
BrianFoote  quote  CS  computerscience  math  mathematics  interesting  fun  academia 
september 2007 by rafaeldff
Shtetl-Optimized » Blog Archive » What Google Won’t Find
Interesting non-technical article on the relation between NP-completeness and quantum computing. It also touches on the nature of the relationship between physics and the P=NP problem.
article  ScottAaronson  blog  post  computing  computerscience  mathematics  physics  P=NP  problem  math  quantum  complexity  lecture  transcript 
august 2007 by rafaeldff
Three Beautiful Quicksorts
Jon Bentley presents thee Quicksorts: the first one applies a simpler partition() function; the second is really a code-driven algorithm analysis; and the third, an "industrial-strength" version. Stay till the end to catch Josh Bloch's comments.
video  JonBentley  google  TechTalk  Quicksort  algorithm  analysis  computerscience  CS  sorting  qsort  JoshuaBloch  JoshBloch  presentation 
august 2007 by rafaeldff
Global Nerdy » Blog Archive » Laws of Software Development
Compendium of programming and computer science "laws", from Amdahl's up to Wirth's and Zawinski's.
blog  post  article  reference  programming  development  CS  ComputerScience  law  laws  rule  rules  list  catalog  compendium 
july 2007 by rafaeldff
Communications of the ACM - Volume 50 , Issue 6 (June 2007) - Forum
David Parnas writes to CACM:
"Dijkstra said many useful things. Among them is the most useful definition of “abstraction” I know: “An abstraction is one thing that represents several real things equally well.”"
letter  Parnas  CACM  forum  DavidParnas  DavidLParnas  Dijkstra  EdsgerDijkstra  software  CS  ComputerScience  abstraction 
july 2007 by rafaeldff
A brief history of Consensus, 2PC and Transaction Commit. Beta Thoughts
Not so brief, in fact. Lots of links to relevant papers, and a superb job of contextualizing those developments. Of course, to really understand the algorithms we have to consult the literature (including those linked papers).
blog  post  MarkMcKeown  distributed  systems  CS  ComputerScience  algorithm  algorithms  transaction  consensus  2PC  3PC  Paxos  fault  availability  safety  research  SOA  REST 
june 2007 by rafaeldff
Alan Kay: The Computer Revolution hasn't happend yet. Keynote OOPSLA 1997 - Google Video
I don't know why this wasn't already bookmarked. Alan Kay is, as always, excellent. Quote: "arrogance in computer science is measured in nano-Dijkstras".
AlanKay  presentation  video  OOPSLA  keynote  1997  Oopsla1997  OO  Smalltalk  PC  innovation  language  history  computerscience  cs  personal  computer  computing  information 
may 2007 by rafaeldff
Have we learned anything in the last 20 years? - Mail Thread Index
Interesting comp-os-research usenet thread sparked by Andy Tanenbaum (in 1992) discussing what did they know, at the time, regarding distributed (operating) systems. Among the responders are Rob Pike, Ken Thompson, Phil Winterbottom, Werner Vogels and Ken
thread  mail  mailing  list  newsgroup  usenet  OS  distributed  system  systems  comp.os.research  AndrewTanenbaum  RobPike  KenThompson  PhilWinterbottom  WernerVogels  KennethBirman  1992  1990s  research  CS  computerscience  computer  science 
may 2007 by rafaeldff
"making the systems self managing: the systems will reconfigure themselves to handle changes in their environment or requirements....""A major innovation of SELFMAN is to combine the strengths of structured overlay networks and advanced component models."
PeterVanRoy  research  project  CS  ComputerScience  distributed  system  systems  grid  p2p  autonomic  autonomous  computing  self-healing  self-organizing  self-organization  Oz  Mozart  component  CBD 
may 2007 by rafaeldff
Jonathan Sobel: Categorical Semantics (Dan Friedman's 60th Birthday) - Google Video
Another cool video from Dan Friedman's 60th birthday event. This is Jonathan Sobel (very) briefly describing category theory as a semantic model and as a basis for compiler/interpreter implementations.
video  presentation  JonathanSobel  CategoryTheory  Category  theory  CS  computerscience  programming  language  implementation  design  semantics  formal  formalism  DanFriedman 
march 2007 by rafaeldff
Freedom to Tinker » Blog Archive » Programs vs. Data
A very simple direct explanation of why code and data are the same thing. Can be useful for didactic purposes.
EdFelten  blog  post  article  programming  language  computing  interpreter  code  data  information  CS  ComputerScience 
february 2007 by rafaeldff
Steps Toward The Reinvention of Programming | Lambda the Ultimate
Alan Kay's newest ambitious super project - “End-User to the Metal” Personal Computing. Definitely "pink plane" stuff. The video linked from the comments (and comments themselves) are also interesting. Oh, and Alan Kay rocks! I just wanted to leave th
AlanKay  LtU  paper  project  CS  ComputerScience  research  systems  programming  OO  OS  software 
february 2007 by rafaeldff
Turing Equivalent vs. Turing Complete
Turing Equivalence is a property of computing models, Turing Completeness is a (much rarer) property of computations.
blog  post  cs  computation  computing  turing  TuringMachine  turingcompleteness  completeness  complexity  ComputerScience  MarkChu-Carroll  MarkCChu-Carroll  Chu-Carroll 
january 2007 by rafaeldff
Teaching Discrete Mathematics via Primary Historical Sources | Lambda the Ultimate
"(...) written curricular materials, based on primary historical sources, for beginning and advanced undergraduate courses in discrete mathematics and computer science."
ltu  CS  computerscience  mathematics  algorithm  discrete  math  foundations  history  academic  course  academia  reference  exercises  material 
december 2006 by rafaeldff
The h Index for Computer Science
"a partial list of computer science researchers who each has h ~ 40". ["the index h, defined as the number of papers with citation number higher or equal to h, as a useful index to characterize the scientific output of a researcher." ]
page  list  CS  computerscience  research  scientists  famous  metric  metrics  h-index  h  rank  ranking  academia  citations  citation  science  index  papers 
december 2006 by rafaeldff
A tutorial on the universality and expressiveness of fold
"This article is a tutorial on two key aspects of the fold operator for lists. [1:] we emphasize the use of the universal property of fold [] as a proof principle [], and as a definition principle[]. [2:], we show that [] the fold operator has greater exp
paper  functional  programming  haskell  fold  function  operator  GrahamHutton  CS  computerscience  proof  formal  formalism  language 
december 2006 by rafaeldff
Theoretical Computer Science Cheat Sheet (pdf)
Tending more towards algorithm analysis and numerical computing than formal methods, but its still pretty good.
MartinJansche  academic  cheatsheet  computer  computerscience  cs  math  mathematics  reference  formuli  formula  theoretical  theory  complexity  algorithm  analysis  graph  numerical  computing  TeX 
november 2006 by rafaeldff
Rob Pike - Systems Software Research is Irrelevant
Pike's famous paper on the importance of systems research nowdays.
paper  article  RobPike  system  systems  research  academic  academia  OS  basic  science  cs  computerscience 
october 2006 by rafaeldff
The Algorithm: Idiom of Modern Science
Famous physicists bashing, american history jokes, semiotics and criptography on an excellent introduction to (algorithmic) computer science
BernardChazelle  Princeton  essay  article  introduction  computerscience  cs  computing  complexity  algorithm  algorithms  math  mathematics  linguistics  history  physics  philosophy  science  cryptography  tractability  decidability  NP  analysis  academia  academic 
september 2006 by rafaeldff
The SKI Combinator Calculus a universal formal system
SKI combinators can be expressed on Lambda Calculus. I didn't know they were also an independent formal system. This article gives a nice (and short) introduction and talks about self-refertiality (Gödel-like "theorems")
article  academic  logic  formal  formalism  system  calculus  combinator  SKI  lambda  derivation  foundation  LambdaCalculus  CS  computerscience 
september 2006 by rafaeldff
Traits: A Mechanism for Fine-grained Reuse
"Existing schemes based on single inheritance, multiple inheritance, or mixins, all pose numerous problems for reuse. To overcome these problems we propose traits, pure units of reuse consisting only of methods. We develop a formal model of traits that e
paper  traits  StéphaneDucasse  OO  theory  mixins  inheritance  multiple  MultipleInheritance  CS  computerscience  trait  mixin  Smalltalk  OscarNierstrasz  NathanaelSchärli  RoelWuyts  AndrewBlack  StephaneDucasse  reuse  composition  language  design 
august 2006 by rafaeldff
All Things Distributed: Life is not a State-Machine
Werner Vogels' opinion on university-market technology transfer, focusing specifically on distributed systems.
WenerVogels  blog  post  article  research  academia  market  technology  transfer  economy  society  distributedsystems  distributed  system  systems  computerscience  CS 
august 2006 by rafaeldff
The True Story Of Network Layering - And The Origin Of The OSI Model
Douglas Comer finally unveils the long suspected Disney(tm) connection on the origins of OSI's 7 layers.
funny  article  DouglasComer  fun  humor  networking  network  OSI  layer  layering  layers  Disney  dwarfs  dwarf  geek  CS  computerscience 
august 2006 by rafaeldff
How To Criticize Computer Scientists
2-step process: profile and then zing. Ex: Theorist? "Isn't this just a straightforward extension of an old result by Hartmanis?". Experimentalist? "Isn't it obvious that there's a bottleneck in the system that prevents scaling to arbitrary size?"
funny  article  DouglasComer  Comer  academia  CS  computerscience  computing  criticism  SE  SoftwareEngineering  scalability  Humor 
august 2006 by rafaeldff
Three Sins of Authors in Computer Science and Math
Grandmothering (silly intros), A table of contents in a paragraph (in section n we'll bla bla), Conclusions that don't (silly conclusions)
writing  academic  academia  papers  paper  english  tip  tips  advice  CMU  math  CS  computerscience  JonathanShewchuk  thesis  research  reference  science 
august 2006 by rafaeldff
Programming Languages and Lambda Calculi (pdf)
"[A] comprehensive treatement of the semantics of typed and untyped call-by-value programming languages" via LtU, a 189pgs text on LC and formal semantics
lambda  calculus  LambdaCalculus  calculi  text  tutorial  paper  formal  formalism  semantics  introduction  semantic  programming  language  theory  PLT  PLTheory  PL  LC  via:ltu  book  online  CS  ComputerScience 
july 2006 by rafaeldff
Symbolic links
Programming through file system symbolic links (not sure if its Turing Complete, or just a FSA simulation). User interface? ls! Example code? Conway's Life!
software  coding  programming  hacking  fun  insanity  unix  computing  compute  machine  automata  hack  model  CS  ComputerScience  Life  ConwayLife  code 
june 2006 by rafaeldff
Free Computer Science Video Lecture Courses
Links to CS lectures on various universities (the site looks like an adsense parasite, so no guarantees to long-term availability...)
List  video  videos  CS  ComputerScience  academic  presentations  lecture  lectures  link  links  catalog 
june 2006 by rafaeldff
« earlier      
per page:    204080120160

related tags

2PC  3PC  6.033  80-20  1990s  AbstractAlgebra  abstraction  academia  academic  acm  activelearning  activity  advice  advocacy  ai  AIT  alankay  AldoCortesi  AlexeyRadul  algebra  algorithm  algorithmic  AlgorithmicInformationTheory  algorithms  AllenHolub  AmericanScientist  analogy  analysis  AndrewBlack  AndrewTanenbaum  AnnGrbavec  anti  ApostolosDoxiadis  architecture  archive  arithmetic  art  article  articles  ArtificialIntelligence  Asymptotics  audio  automata  autonomic  autonomous  availability  BabarKZafar  BabarZafar  Barendregt  Barendsen  basic  bcc  BenjaminC.Pierce  BenMoseley  berkeley  berkley  BernardChazelle  bibliography  binary  bio  biography  biology  bitcoin  BitTwiddling  blog  BoazBarak  book  books  brain  BrianFoote  BrianHayes  brown  C  CACM  calculi  calculus  casestudy  catalog  categories  category  categorytheory  CBD  cd  CG  CGI  Chaitin  chapter  cheatsheet  children  ChirstosPapadimitriou  CHPapadimitriou  ChrisAmmerman  ChrisOkasaki  ChrisRathman  ChristopherDiggins  ChristosPapadimitriou  Chu-Carroll  Church  citation  citations  Clarck  Clark  classic  classics  classroom  CLEAN  cleremont  CMU  code  coding  cognition  cognitive  Cognitiveload  CognitivePsychology  CogSci  collection  college  color  colorization  colors  column  combinator  Comer  comics  comp.os.research  compendium  compilation  compiler  completeness  complexity  ComplexityTheory  component  composition  CompterScientist  computation  compute  computer  computers  computerscience  computerworld  computing  conference  consensus  ConstraintProgramming  contract  ConwayLife  Coq  corba  Counting  course  crawler  crawling  critic  criticism  critique  cryptography  cs  CT  Curry-Howard  DACTL  DanFriedman  data  database  databases  databse  DataMining  datastructure  DataStructures  DaveThomas  DavidEvans  DavidLParnas  DavidMacKay  DavidParnas  db  DBMS  DBS  DDClark  decidability  decidable  declarative  derivation  design  development  digest  dijkstra  discipline  discrete  Disney  distributed  distributedcomputing  distributedsystems  distribution  DonaldKnuth  DonKnuth  DorotheaBlostein  DouglasComer  DPReed  draft  DS  dwarf  dwarfs  dynamic  DynamicProgramming  ebook  economy  EdFelten  EdsgerDijkstra  EdsgerWybeDijkstra  edtech  edu  education  empirical  end-to-end  endtoend  engineering  english  EricGWagner  EricWagner  essay  evidence  EWD  EWD1305  example  examples  exercises  Facile  famous  fault  FFT  FloatingPoint  fold  formal  formalism  Formalsemanticsofprogramminglanguages  formula  formuli  forum  foundation  foundations  FP  FranciscoReverbel  FredBrooks  free  Frege  fun  function  functional  Functionalprogramming  fundamental  fundamentals  funny  future  geek  generics  Gentzen  georgedyson  GeraldJaySussman  GeraldSussman  git  GJChaitin  Glauert  godel  google  GrahamHutton  grammar  grammars  graph  graphic  graphics  graphs  GregoryChaitin  GregoryJChaitin  GregWilson  grid  gui  Gutemberg  GuySteele  h  h-index  hack  hacking  halt  halting  haltingproblem  handbook  hardware  hash  haskell  hci  HenkBarendregt  HenkPBarendregt  high-perf  high-performance  higher  hiphop  history  HodaFahmy  htdp  html  http  humor  humour  ibm  imaging  imperative  implementation  important  incompleteness  indentation  index  Induction  information  InformationTheory  inheritance  innovation  insanity  intelligence  interesting  interpreter  interview  intro  introduction  IO  IvanEdwardSutherland  java  JeroenFokker  JHSaltzer  JohnHughes  JohnTromp  JonathanShewchuk  JonathanSobel  JonBentley  JoshBloch  JoshuaBloch  JRKennaway  JRWGlauert  Kennaway  KennethBirman  KenThompson  keynote  kids  Knuth  Kolmogorov  KolmogorovComplexity  lambda  LambdaCalculus  language  languages  latency  law  laws  layer  layering  layers  LC  LEAN  learn  learning  lecture  lecturenotes  lectures  lego  LESLIELAMPORT  letter  Life  linear  linguistics  link  links  lisp  list  literature  logic  LP  ltu  lyrics  machine  mail  mailing  management  MarkCC  MarkCChu-Carroll  MarkChu-Carroll  MarkChuCarroll  market  marketing  MarkGuzdial  MarkMcKeown  MARSHALLPEASE  MartinJansche  material  math  mathematics  mathmatics  MaximillianDornseif  media  MerkleTree  meta  metamathmatics  method  methodology  metric  metrics  MichaelJohnson  missive  mit  mixin  mixins  model  Monad  Monoid  Monzy  Mozart  mp3  MRSleep  MultiParadigm  multiple  MultipleInheritance  music  myths  narration  NathanaelSchärli  network  networking  news  NewScientist  newsgroup  NoamNisan  NoSilverBullet  notes  NP  NumberTheory  numerical  OCW  OGR  OGRe  online  oo  oop  OOPSLA  Oopsla1997  operator  opinion  optimization  OS  OscarNierstrasz  OSI  oxford  Oz  p2p  P=NP  page  paper  papers  paradigm  paradigms  Parnas  PaulRoberts  Paxos  PC  pdf  pedagogy  performance  Permutations  person  personal  PersonalComputer  PeterMarks  PeterVanRoy  phd  PhilipWadler  philosophy  PhilWindley  PhilWinterbottom  physics  PI  PI-calculus  Pigeonholing  PL  PLAI  plt  PLTheory  pm  podcasts  polemic  portuguese  poscast  post  posts  PragDave  predicate  predication  presence  presentation  presentations  press  princeton  printing  Probability  problem  process  processing  produ  productivity  Products  professor  professors  programming  project  ProjectManagement  prolog  proof  Proofs  propagator  propagators  protocol  psychology  pt  pt-br  pub  publications  publishing  q&a  QC  qsort  quantum  QuantumComputing  query  questions  queue  Quicksort  quote  quotes  rank  ranking  rap  rapper  RDBMS  reading  recommendations  recursion  RecursiveDefinitions  Reed  reference  relational  Relations  report  research  rest  reuse  reverbel  review  rewriting  richardgabriel  RichardKarp  RichardPGabriel  ROBERTSHOSTAK  RobPike  RoelWuyts  RSA  rule  rules  safety  salon  Saltzer  sample  samples  SanjeevArora  scalability  scheme  scholar  science  sciences  Scientificcontrol  scientist  scientists  ScottAaronson  SDasgupta  SE  search  searchengine  security  self-healing  self-organization  self-organizing  semantic  semantics  server  ShimonSchocken  ShriramKrishnamurthi  SICP  simplex  simplicity  site  sketchpad  SKI  Sleep  smalltalk  SOA  society  software  softwareengineering  song  sorting  speech  spider  squeak  StanKelly-Bootle  StanKellyBootle  state  StateMachines  statistics  stats  StephaneDucasse  StephenWolfram  SteveEasterbrook  SteveSkienna  StructuralInduction  structure  style  StéphaneDucasse  Sums  sun  Sussman  syntax  system  systems  talk  teaching  technique  technology  TechTalk  test  TeX  text  textbook  theorem  theoretical  theory  theoty  thesis  thread  tip  tips  TM  tolisten  toread  tractability  TracyLarrabee  trait  traits  transaction  transcript  transfer  transformation  trends  trivia  turing  turingcompleteness  turingmachine  tutorial  type  types  typing  UA  UCSD  ui  uk  universal  UniversalAlgebra  university  unix  unreleased  usenet  UTM  UVVazirani  versioning  via:arsyed  via:ltu  VictoriaLivschitz  VictorShoup  video  videos  visualization  vonneuman  web  WenerVogels  WernerVogels  whitespace  Wolfram  workstation  worseisbetter  writing  www 

Copy this bookmark: