Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 235253
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 11, 20262026-05-11T20:15:04+00:00 2026-05-11T20:15:04+00:00

If Moore’s Law holds true, and CPUs/GPUs become increasingly fast, will software (and, by

  • 0

If Moore’s Law holds true, and CPUs/GPUs become increasingly fast, will software (and, by association, you software developers) still push the boundaries to the extent that you still need to optimize your code? Or will a naive factorial solution be good enough for your code (etc)?

  • 1 1 Answer
  • 1 View
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-11T20:15:04+00:00Added an answer on May 11, 2026 at 8:15 pm

    Poor code can always overcome CPU speed.

    For an excellent example, go to this Coding Horror column and scroll down to the section describing the book Programming Pearls. Reproduced there is a graph showing how, for a certain algorithm, a TRS-80 with a 4.77MHz 8-bit processor can beat a 32-bit Alpha chip.TRS-80 vs. Alpha
    (source: typepad.com)

    The current trend in speedups is to add more cores, ’cause making individual cores go faster is hard. So aggregate speed goes up, but linear tasks don’t always benefit.

    The saying "there is no problem that brute force and ignorance cannot overcome" is not always true.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Edit: As Andrew Moore pointed out this question is a duplicate of Two separate
I am facing issues in understanding Boyer Moore String Search algorithm. I am following
I need three fast-on-large-strings functions: fast search, fast search and replace, and fast count
While applying Boyer–Moore string search algorithm to the string : SSIMPLE EXAMPLE with a
In this talk , Chuck Moore (the creator of Forth) makes some very bold,
I am searching for a Matlab implementation of the Moore-Penrose algorithm computing pseudo-inverse matrix.
$ptn = /^Response.+?[:] /; $str = Response from Moore Auto: Thanks for your feedback;
I'm calling a JSON object and in Firebug it returns this response : [{\employee\:{\account_id\:1,\active\:true,\activity_ical_hash\:\af2d0f784ce28bc16d6fdf593d3e4bc7\,\address\:null,\admin\:false,\all_tasks_ical_hash\:\d4067eceea22b2f281c65f22ccc7820f\,\always_send_daily_schedule\:true,\api_token\:\8d4ab012505392a25d1469e33945d9b05365eedb\,\can_login\:true,\cell_phone\:null,\city\:null,\created_at\:\2012-02-20T09:41:27-08:00\,\custom_datetime1\:null,\custom_datetime10\:null,\custom_datetime2\:null,\custom_datetime3\:null,\custom_datetime4\:null,\custom_datetime5\:null,\custom_datetime6\:null,\custom_datetime7\:null,\custom_datetime8\:null,\custom_datetime9\:null,\custom_number1\:null,\custom_number10\:null,\custom_number2\:null,\custom_number3\:null,\custom_number4\:null,\custom_number5\:null,\custom_number6\:null,\custom_number7\:null,\custom_number8\:null,\custom_number9\:null,\custom_text1\:null,\custom_text10\:null,\custom_text2\:null,\custom_text3\:null,\custom_text4\:null,\custom_text5\:null,\custom_text6\:null,\custom_text7\:null,\custom_text8\:null,\custom_text9\:null,\email_address\:\mckenna_moore@schumm.org\,\email_schedule_daily\:true,\employee_number\:4,\hashed_password\:\cbc689313dfd6fd144f7df117c4f18e1627afde4\,\hide_pricing\:null,\home_phone\:null,\id\:4,\is_account_owner\:false,\jobs_ical_hash\:\d51abd7af0326083f9d25c4aacc828c0\,\limit_access_to_assignments\:false,\name\:\Horacio
Does the KMP (Knuth–Morris–Pratt) algorithm perform fewer comparisons than the simplified Boyer-Moore algorithm?
Need to design a simple one for school. More specifically a Moore FSM. Im

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.