Hardcore | |
---|---|
[[file: |frameless|alt=|]] | |
Directed by | Paul Schrader |
Produced by | Buzz Feitshans John Milius |
Written by | Paul Schrader |
Starring | George C. Scott Peter Boyle Season Hubley |
Music by | Jack Nitzsche |
Cinematography | Michael Chapman |
Editing by | Tom Rolf |
Studio | A-Team Productions |
Distributed by | Columbia Pictures |
Release date(s) | February 9, 1979 (USA) |
Running time | 109 Minutes |
Country | United States |
Language | English |
Hardcore is a 1979 American drama film written and directed by Paul Schrader and starring George C. Scott. Writer-director Schrader had previously written the screenplay for Martin Scorsese's Taxi Driver, and both films share a theme of exploring an unseen subculture.
Contents |
Jake Van Dorn (George C. Scott) is a prosperous local businessman in Grand Rapids, Michigan who has strong Calvinist convictions. A single parent, Van Dorn is the father of a seemingly quiet, conservative teenage girl, Kristen, who inexplicably disappears when she goes on a church-sponsored trip to California. A strange private investigator, Andy Mast (Peter Boyle) from Los Angeles, is hired, eventually turning up a 8mm stag film of his daughter with two young men.
Van Dorn then suspects that his daughter was kidnapped and forced to join California's porno underworld. His quest to rescue her takes him into an odyssey through this "adult" underground.
Getting no results from the PI, the police or even from Los Angeles' adult shopkeepers and "rap parlor" women, a desperate Van Dorn ends up posing as a pornography producer, hoping to find information about his daughter. A straggly actor named "Jism Jim", who was in the film with Kristen, knows where she might be and sends him to a sometime porno actress/hooker named Niki (Season Hubley). Their uneasy alliance moves from L.A. to San Diego and ends in San Francisco where Van Dorn finds that Kristen may be in the hands of a very dangerous porn player who deals in the world of "snuff movies."
|
Hardcore is a 1977 British comedy film directed by James Kenelm Clarke and starring Fiona Richmond, Anthony Steel, Victor Spinetti, Ronald Fraser and Harry H. Corbett. It depicts a highly fictionalised account of the life of Richmond, who was a leading pin-up in the 1970s.
In the US the film was known as Fiona.
Hardcore is an album by Daddy Freddy.
Serious is an album by American blues guitarist Luther Allison, released in 1987 on the Blind Pig label.
All songs by Luther Allison, unless otherwise noted.
Rockferry is the debut studio album by Welsh recording artist Duffy, released on 3 March 2008 in the United Kingdom by A&M Records. It was released in the United States by Mercury Records. Duffy worked with several producers and writers on the album, including Bernard Butler, Steve Booker, Jimmy Hogarth and Eg White. The album took four years to record in total.
The album has won a number of awards since its release, including the Grammy Award for Best Pop Vocal Album at the 51st annual ceremony (2009). Duffy also won three awards at the 2009 BRIT Awards for her work on Rockferry including Best British Album, whilst Butler was given the Producer's Award.
It was a commercial success, reaching number-one in several music markets. It was the fourth best selling album of 2008 worldwide according to the International Federation of the Phonographic Industry and the highest of that year in the United Kingdom. In the UK the album was still in the top five a full year after its release, spending most of those weeks in the top ten albums, and a significant amount in the top three. In 2010, it was ranked the 22nd best-selling album of the 2000s in the UK.
PCP may refer to:
In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof. The algorithm is then required to accept correct proofs and reject incorrect proofs with very high probability. A standard proof (or certificate), as used in the verifier-based definition of the complexity class NP, also satisfies these requirements, since the checking procedure deterministically reads the whole proof, always accepts correct proofs and rejects incorrect proofs. However, what makes them interesting is the existence of probabilistically checkable proofs that can be checked by reading only a few bits of the proof using randomness in an essential way.
Probabilistically checkable proofs give rise to many complexity classes depending on the number of queries required and the amount of randomness used. The class PCP[r(n),q(n)] refers to the set of decision problems that have probabilistically checkable proofs that can be verified in polynomial time using at most r(n) random bits and by reading at most q(n) bits of the proof. Unless specified otherwise, correct proofs should always be accepted, and incorrect proofs should be rejected with probability greater than 1/2. The PCP theorem, a major result in computational complexity theory, states that PCP[O(log n),O(1)] = NP.