Jump to content

Talk:Algorithm design: Difference between revisions

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
Content deleted Content added
Yobot (talk | contribs)
m clean up using AWB (6823)
Line 10: Line 10:


As I ponder, lets expand algorithm design or algorithmic design to the mathematical process of solutions. An algorithm is a set. A set of mathematical equations, and logical processes, eg. the IF-THEN-ELSE concept or process for complexes of non-linear thought.
As I ponder, lets expand algorithm design or algorithmic design to the mathematical process of solutions. An algorithm is a set. A set of mathematical equations, and logical processes, eg. the IF-THEN-ELSE concept or process for complexes of non-linear thought.

[[Special:Contributions/80.192.137.214|80.192.137.214]] ([[User talk:80.192.137.214|talk]]) 09:30, 24 August 2010 (UTC)Sets are data structures with no repeats. An algorithm is a "To-do list" of logical and mathematical operations, soe of these can ofcourse be the same. Therefore an algorith is not a set.


Programming languages, like ALGOL, FORTRAN, COBOL, PL/I, SAIL, SNOBOL, etc. are methods to implement an "algorithm design"... but, an "algorithm design" (a/d) is not a language. An a/d can be a hand written process, eg. set of equations, a series of mechanical processes done by hand, an analog piece of equipment, or a digital process and/or processor.
Programming languages, like ALGOL, FORTRAN, COBOL, PL/I, SAIL, SNOBOL, etc. are methods to implement an "algorithm design"... but, an "algorithm design" (a/d) is not a language. An a/d can be a hand written process, eg. set of equations, a series of mechanical processes done by hand, an analog piece of equipment, or a digital process and/or processor.

Revision as of 09:30, 24 August 2010

Redirect

A redirect is correct, forgive me, I am a nubie, but learning quick ... a ton to learn in Wiki-land. Thanks. LanceBarber 04:23, 3 April 2007 (UTC)[reply]

As I ponder, lets expand algorithm design or algorithmic design to the mathematical process of solutions. An algorithm is a set. A set of mathematical equations, and logical processes, eg. the IF-THEN-ELSE concept or process for complexes of non-linear thought.

80.192.137.214 (talk) 09:30, 24 August 2010 (UTC)Sets are data structures with no repeats. An algorithm is a "To-do list" of logical and mathematical operations, soe of these can ofcourse be the same. Therefore an algorith is not a set.[reply]

Programming languages, like ALGOL, FORTRAN, COBOL, PL/I, SAIL, SNOBOL, etc. are methods to implement an "algorithm design"... but, an "algorithm design" (a/d) is not a language. An a/d can be a hand written process, eg. set of equations, a series of mechanical processes done by hand, an analog piece of equipment, or a digital process and/or processor.

This is a rudimentary beginnings of a long and in-depth discussion.

Thus, to implement a simple IF-THEN-ELSE process lets not equate the a/d to ALGOL so quickly. Thank you, LanceBarber 04:45, 3 April 2007 (UTC)[reply]

I don't really get a lot of the technical stuff you mentioned, but I've undid the redirect. However, to avoid redirection or deletion, the page must have something more than "See (other page) for this topic," because that is the exact same thing as a redirect, but non-standard and harder to deal with. Therefore, I'm placing some tags explaining that the page is still under construction.
However, given the nature of the topic, I suspect there might already be an article on this same topic. You should check more carefully just to make sure before putting too much work into this article. No need to reinvent the wheel, right? Anyway, you can continue working on the article. First, I suggest giving it a topic other than just a "see other topic." Then just continue to develop the article. Pyrospirit Flames Fire 17:58, 3 April 2007 (UTC)[reply]
Thank you. I am trying to find the article I was reading that had this topic highlighted/linked/in-red. The 'algorithm design' concept was being compared with something else. So I quickly created a one-liner for discussion and further expansion. I'm learning fast and seem to be generating work for myself. If we can expand expand this article, great; if not, I'll find the double bracket term and article, and add a footnote to the article. Then, mark this page/article for deletion. Thanks. LanceBarber 18:07, 3 April 2007 (UTC)[reply]
It's pretty easy to find the article that links here. Just click "What links here" in the toolbox on the left side of the window. It shows every page with a link to the article. For your convenience, here's a link that takes you to the same "What links here" page: Special:Whatlinkshere/Algorithm design. Pyrospirit Flames Fire 22:22, 3 April 2007 (UTC)[reply]
Thank you. I got a short start, too. LanceBarber 06:07, 4 April 2007 (UTC)[reply]

Removed under construction template

I have added definitions, internal links, references, further readings, categories, examples, and languages. Hopefully other Wikians can add more depth; and relationships with the many elements of operations research and dynamic programming. I will be reseaerching more at my local library and provide a bibliography this summer. I left the "stub" category as a reminder for further expansion. LanceBarber 19:15, 8 April 2007 (UTC)[reply]