Tag: complexity classes

• More on P and NP

  From Frank Vega:   I wanted to answer you one of your comments in your post “Even if P=NP we might see no benefit“, but I saw I can’t do it anymore in that page, maybe due to problem with my internet. I was the person who claim a possible demonstration of problem “P versus…

  Adrian McMenamin

  May 22, 2013

  Uncategorized

  Arxiv, complexity, complexity classes, computer science, Frank Vega, P versus NP problem

• Have we reached “peak silicon” and what can we do about it?

  Moore’s Law states that the number of transistors that can be squeezed into a given slice of silicon doubles every two years (or 18 months) – something I wrote about recently and where I declared “More transistors means greater speed, more and cheaper memory and so on … ” Except, maybe not. As the graph…

  Adrian McMenamin

  February 3, 2012

  Uncategorized

  Algorithm, Amdahl’s law, Clock rate, complexity classes, dark silicon, Fast Fourier transform, Free Lunch Is Over, Moore’s Law, P==NP, Parallel computing, peak silicon, quantum computing

• In continued praise of “Programming Pearls”

  I have read two books in the last year that have fundamentally changed the way I think about computers and programming – The Annotated Turing and Programming Pearls. Programming Pearls in particular continues to inspire me in the way it makes you think about building better algorithms and using data structures better – and here’s…

  Adrian McMenamin

  July 19, 2011

  Uncategorized

  algorithms, Annotated Turing, Big O notation, C programming, C++, complexity classes, GCC, Linked list, Linux, Linux system programming, memory use, proc file system, programming, ptrace