HOUSE_OVERSIGHT_015948.jpg

1.38 MB

Extraction Summary

4
People
3
Organizations
2
Locations
1
Events
1
Relationships
3
Quotes

Document Information

Type: Book page / academic text (house oversight production)
File Size: 1.38 MB
Summary

This document is page 258 of a book or article titled 'Are the Androids Dreaming Yet?' stamped with a House Oversight Committee identifier. The text discusses mathematical theory regarding computability, specifically referencing Emil Post, Alan Turing, and the 'Post Word Problem' in relation to music analysis. While the document is part of a House Oversight production (likely related to the Epstein investigation given his ties to the scientific community), the text itself is purely academic and contains no direct information regarding Epstein's criminal activities or financial transactions.

People (4)

Name Role Context
Emil Post Mathematician
Studied non-computable problems; contemporary of Alan Turing; studied at Institute of Advanced Mathematics.
Alan Turing Mathematician
Contemporary of Emil Post; known for Turing machines.
Gennadii Makanin Mathematician
Russian mathematician based at the University of Moscow; found sets of simple puzzles that are non-computable.
Martin Davis Mathematician
Proved word substitution puzzles are non-computable in 1948.

Organizations (3)

Name Type Context
Institute of Advanced Mathematics
Located in Princeton; where Emil Post studied.
University of Moscow
Location where Gennadii Makanin was based.
House Oversight Committee
Implied by the footer stamp 'HOUSE_OVERSIGHT_015948'.

Timeline (1 events)

1948
Martin Davis proved that word substitution puzzles are a class of non-computable problem.
Unknown

Locations (2)

Location Context

Relationships (1)

Emil Post Professional/Academic Alan Turing
Post was a contemporary of Alan Turing

Key Quotes (3)

"Is music a computational or a creative endeavor?"
Source
HOUSE_OVERSIGHT_015948.jpg
Quote #1
"An accountant would say it needs to pass 'the smell test'."
Source
HOUSE_OVERSIGHT_015948.jpg
Quote #2
"Can a computer tell us which word problems have a solution and which do not? The answer is 'no'."
Source
HOUSE_OVERSIGHT_015948.jpg
Quote #3

Full Extracted Text

Complete text extracted from the document (2,077 characters)

258 Are the Androids Dreaming Yet?
this argument, but music is much easier to analyze. It is linear, highly mathematical and largely uniform by culture and language. Yet it is universally appreciated. Is music a computational or a creative endeavor?
Is Music Computable
To prove a piece of music is non-computable requires two tests. First to show we can 'reduce' it to a problem that is already non-computable and, second, to demonstrate it 'looks like' or 'sounds like' a piece of music. An accountant would say it needs to pass 'the smell test'.
The first non-computable problem to be studied in depth was Emil Post's Word Problem. Post was a contemporary of Alan Turing and studied at the Institute of Advanced Mathematics in Princeton. He solved the Halting Problem six months before Turing, but his proof used a complex recursive method called the lambda calculus. Turing's method was far more practical, which is why we now refer to Turing machines rather than Post machines. Later in his career, Post came up with a branch of non-computable mathematics called 'Post Problems'. They look like a puzzle you might find in a newspaper. Imagine starting with the word 'camel' and being asked to turn it into 'aardvark', using only a few simple rules. We'll make the problem very easy to start with: cam <-> aard and el <-> vark. This solution is obvious; just do the substitutions and you are there. But what if the rules were a little more complex? Gennadii Makanin, a Russian mathematician based at the University of Moscow, found a set of extremely simple puzzles that are nevertheless non-computable. Here is one:
{"CCBB" <-> "BBCC", "BCCCBB" <-> "CBBBCC", "ACCBB" <-> "BBA", "ABCCCBB" <-> "CBBA", "BBCCBBBBCC" <-> "BBCCBBBBCCA"}
Word Problem
Can a computer tell us which word problems have a solution and which do not? The answer is 'no'. Word substitution puzzles are a class of non-computable problem. Martin Davis proved this in 1948. Using a reduction argument we can use these word problems to prove some music is also non-computable.
HOUSE_OVERSIGHT_015948

Discussion 0

Sign in to join the discussion

No comments yet

Be the first to share your thoughts on this epstein document