Deleted
Deleted Member
Posts: 0
|
Post by Deleted on Jul 20, 2015 21:31:41 GMT -5
Mission impossible:ghost protocol
|
|
|
|
Post by teaman on Jul 20, 2015 21:48:37 GMT -5
Gone Girl.
Good movie. So glad I never met that woman...
|
|
|
|
Post by vneal on Jul 21, 2015 7:59:06 GMT -5
SHARK WEEK
Shark Zombie
bad as in not good
|
|
|
|
Post by wilburthegoose on Jul 21, 2015 15:55:40 GMT -5
Spy, at the world famous Narrow Gauge Cinema in Farmington, ME. $6 for a ticket, and $4 for buttered popcorn. All state-of-the-art theater too. Unfortunately, I live 500 miles SE of Farmington, ME, so it was a one-time visit  If you're ever up that way, I can't recommend it more highly: www.narrowgaugecinema.net/ |
|
|
|
Post by chaosrv on Jul 21, 2015 16:08:42 GMT -5
Spy, at the world famous Narrow Gauge Cinema in Farmington, ME. $6 for a ticket, and $4 for buttered popcorn. All state-of-the-art theater too. Unfortunately, I live 500 miles SE of Farmington, ME, so it was a one-time visit If you're ever up that way, I can't recommend it more highly: www.narrowgaugecinema.net/ That's it. I need to move. I could see THREE movies at that theatre for what it costs for a single ticket at some theatres in NYC. If I want 3D or IMAX...well, let's not talk about what needs to be done to afford those tickets. |
|
|
|
Post by sandtrooper on Jul 21, 2015 18:02:07 GMT -5
Don't have a sub yet. Probably won't be till next year. |
|
|
|
Post by goodfellas27 on Jul 21, 2015 19:49:31 GMT -5
man of steel
epic sound
|
|
Deleted
Deleted Member
Posts: 0
|
Post by Deleted on Jul 21, 2015 21:21:12 GMT -5
Mocking jay part 1
|
|
|
|
Post by novisnick on Jul 21, 2015 21:40:16 GMT -5
A much better thought provoking movie then I thought it would be. For me, it's a must see!  |
|
hemster
Global Moderator 
Particle Manufacturer
...still listening... still watching
Posts: 51,951
|
Post by hemster on Jul 21, 2015 22:07:04 GMT -5
A much better thought provoking movie then I thought it would be. For me, it's a must see! Yes I agree it's a "must see". However there are several factual holes in the plot (especially if you've served in the armed forces) but that doesn't detract from the overall theme. Certainly the acting, direction and production qualities are top-notch. Just my 2¢ FWIW. |
|
AudioBear
Minor Hero
The Only Truth Is Music
Posts: 54 
|
Post by AudioBear on Sept 21, 2015 13:39:24 GMT -5
Went and saw The Scorch Trials yesterday. Big fan of this series, thought it was done really well, though deviated from the book quite a bit.
|
|
|
|
Post by jasong7319 on Oct 12, 2015 1:13:45 GMT -5
Last movie seen was Gone Baby Gone via Netflix. The Mrs picked it out, not a bad movie, not a great movie.
|
|
|
|
Post by jasong7319 on Oct 12, 2015 21:01:27 GMT -5
A much better thought provoking movie then I thought it would be. For me, it's a must see! I liked it enough that I have it on blu-ray, but as far as recent War based movies I liked Lone Survivor more. None of the modern films compare to the classics like Platoon, Full Metal Jacket or Apocalypse Now. |
|
|
|
Post by novisnick on Oct 12, 2015 21:21:55 GMT -5
A much better thought provoking movie then I thought it would be. For me, it's a must see! I liked it enough that I have it on blu-ray, but as far as recent War based movies I liked Lone Survivor more. None of the modern films compare to the classics like Platoon, Full Metal Jacket or Apocalypse Now. Hey guys!!,! These are the " CLASSICS ",,,,,,,,,,, wow!!!,,,,,,,,,,,, wheres my walker?  ?   |
|
|
|
Post by jasong7319 on Oct 13, 2015 18:56:27 GMT -5
I liked it enough that I have it on blu-ray, but as far as recent War based movies I liked Lone Survivor more. None of the modern films compare to the classics like Platoon, Full Metal Jacket or Apocalypse Now. Hey guys!!,! These are the " CLASSICS ",,,,,,,,,,, wow!!!,,,,,,,,,,,, wheres my walker? ? Least I didn't list Pearl Harbor as a classic!!  |
|
|
|
Post by Boomzilla on Nov 28, 2015 8:40:35 GMT -5
The Traveling Salesman:
From Wikipedia:
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
Solution of a travelling salesman problem
TSP is a special case of the travelling purchaser problem and the Vehicle routing problem.
In the theory of computational complexity, the decision version of the TSP (where, given a length L, the task is to decide whether the graph has any tour shorter than L) belongs to the class of NP-complete problems. Thus, it is possible that the worst-case running time for any algorithm for the TSP increases superpolynomially (perhaps, specifically, exponentially) with the number of cities.
The problem was first formulated in 1930 and is one of the most intensively studied problems in optimization. It is used as a benchmark for many optimization methods. Even though the problem is computationally difficult, a large number of heuristics and exact methods are known, so that some instances with tens of thousands of cities can be solved completely and even problems with millions of cities can be approximated within a small fraction of 1%.[1]
The TSP has several applications even in its purest formulation, such as planning, logistics, and the manufacture of microchips. Slightly modified, it appears as a sub-problem in many areas, such as DNA sequencing. In these applications, the concept city represents, for example, customers, soldering points, or DNA fragments, and the concept distance represents travelling times or cost, or a similarity measure between DNA fragments. The TSP also appears in astronomy, as astronomers observing many sources will want to minimise the time spent slewing the telescope between the sources. In many applications, additional constraints such as limited resources or time windows may be imposed.
And regarding P = NP (again from Wikipedia):
The P versus NP problem is a major unsolved problem in computer science. Informally, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. It was essentially first mentioned in a 1956 letter written by Kurt Gödel to John von Neumann. Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.[2] The precise statement of the P versus NP problem was introduced in 1971 by Stephen Cook in his seminal paper "The complexity of theorem proving procedures"[3] and is considered by many to be the most important open problem in the field.[4] It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US$1,000,000 prize for the first correct solution.
The informal term quickly, used above, means the existence of an algorithm for the task that runs in polynomial time. The general class of questions for which some algorithm can provide an answer in polynomial time is called "class P" or just "P". For some questions, there is no known way to find an answer quickly, but if one is provided with information showing what the answer is, it is possible to verify the answer quickly. The class of questions for which an answer can be verified in polynomial time is called NP.
Consider the subset sum problem, an example of a problem that is easy to verify, but whose answer may be difficult to compute. Given a set of integers, does some nonempty subset of them sum to 0? For instance, does a subset of the set {−2, −3, 15, 14, 7, −10} add up to 0? The answer "yes, because the subset {−2, −3, −10, 15} adds up to zero" can be quickly verified with three additions. However, there is no known algorithm to find such a subset in polynomial time (there is one, however, in exponential time, which consists of 2n-n-1 tries), but such an algorithm exists if P = NP; hence this problem is in NP (quickly checkable) but not necessarily in P (quickly solvable).
An answer to the P = NP question would determine whether problems that can be verified in polynomial time, like the subset-sum problem, can also be solved in polynomial time. If it turned out that P ≠ NP, it would mean that there are problems in NP (such as NP-complete problems) that are harder to compute than to verify: they could not be solved in polynomial time, but the answer could be verified in polynomial time.
Aside from being an important problem in computational theory, a proof either way would have profound implications for mathematics, cryptography, algorithm research, artificial intelligence, game theory, multimedia processing, philosophy, economics and many other fields.
|
|
|
|
Post by MusicHead on Nov 28, 2015 10:57:00 GMT -5
Tron Legacy at windows rattling levels :-)
My son and I are rediscovering our action movies collection, courtesy of our new Rythmik L12 sub.
|
|
|
|
Post by vneal on Nov 28, 2015 10:57:58 GMT -5
At theater
Night before Christmas
EXCELLENT
|
|
Deleted
Deleted Member
Posts: 0
|
Post by Deleted on Nov 28, 2015 11:43:24 GMT -5
Into the woods
Phenomenal sound and songs in this one.
|
|
|
|
Post by Loop 7 on Nov 28, 2015 11:53:53 GMT -5
I was skeptical going in but some other members remarked it was quite good and I agree. The suspense pulled me in.  |
|
? 
