Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

“To Really See This Movie”: Ken Jacobs on Tom, Tom … in 1969

View through CrossRef
Abstract Federico Windhausen's “‘To Really See This Movie’: Ken Jacobs on Tom, Tom … in 1969” introduces and contextualizes a newly edited transcript of Ken Jacobs's September 16, 1969, appearance at the Museum of Modern Art's Cineprobe series. The essay reconstructs the historical circumstances of the screening and situates the event within the broader relationship between avant-garde filmmakers and MoMA at the end of the 1960s. Windhausen recounts how Jacobs's program, which included an early editing print of Tom, Tom, the Piper's Son, unfolded amid projection errors and public skepticism from “MoMA regulars.” The surviving audio recording captures some of Jacobs's earliest sustained public reflections on Tom, Tom, revealing the filmmaker's excitement in presenting the work as both an act of rediscovery and a new creation—a “film found and a film made.”
Title: “To Really See This Movie”: Ken Jacobs on Tom, Tom … in 1969
Description:
Abstract Federico Windhausen's “‘To Really See This Movie’: Ken Jacobs on Tom, Tom … in 1969” introduces and contextualizes a newly edited transcript of Ken Jacobs's September 16, 1969, appearance at the Museum of Modern Art's Cineprobe series.
The essay reconstructs the historical circumstances of the screening and situates the event within the broader relationship between avant-garde filmmakers and MoMA at the end of the 1960s.
Windhausen recounts how Jacobs's program, which included an early editing print of Tom, Tom, the Piper's Son, unfolded amid projection errors and public skepticism from “MoMA regulars.
” The surviving audio recording captures some of Jacobs's earliest sustained public reflections on Tom, Tom, revealing the filmmaker's excitement in presenting the work as both an act of rediscovery and a new creation—a “film found and a film made.
”.

Related Results

Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Let [Formula: see text] be a connected graph of order at least two with vertex set [Formula: see text]. For [Formula: see text], let [Formula: see text] denote the length of an [Fo...
Harriet Ann Jacobs
Harriet Ann Jacobs
Now celebrated for her classic slave narrative Incidents in the Life of a Slave Girl (1861), Harriet Ann Jacobs (b. 1813–d. 1897) was an abolitionist, educator, and advocate for fo...
Figurative Language Found in “Wolf Town” Movie
Figurative Language Found in “Wolf Town” Movie
Abstract          This study entitled “figurative language found in “Wolf Town” movie. The purposes of this study are to identify the types of figurative language and to analyze t...
A saturation problem in meshes
A saturation problem in meshes
Let [Formula: see text] and [Formula: see text] be graphs, where we view [Formula: see text] as the “host” graph and [Formula: see text] as a “forbidden” graph. A spanning subgraph...
When is R[θ] integrally closed?
When is R[θ] integrally closed?
Let [Formula: see text] be an integrally closed domain with quotient field [Formula: see text] and [Formula: see text] be an element of an integral domain containing [Formula: see ...
Inductive graph invariants and approximation algorithms
Inductive graph invariants and approximation algorithms
We introduce and study an inductively defined analogue [Formula: see text] of any increasing graph invariant [Formula: see text]. An invariant [Formula: see text] is increasing if ...
The Aα-eigenvalues of the generalized subdivision graph
The Aα-eigenvalues of the generalized subdivision graph
Let [Formula: see text] be a graph with an adjacency matrix [Formula: see text] and a diagonal degree matrix [Formula: see text]. For any graph [Formula: see text] and a real numbe...
Ld(2,1)-labeling on T-graphs
Ld(2,1)-labeling on T-graphs
In this paper, we are concerned with the [Formula: see text]-Graphs, which are graphs defined based on the Topological structure of the given set. Precisely, for a given topology [...

Back to Top