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
Relationships (1)
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
Discussion 0
No comments yet
Be the first to share your thoughts on this epstein document