Back to Results

EFTA02453274.pdf

Source: DOJ_DS11  •  Size: 272.1 KB  •  OCR Confidence: 85.0%
PDF Source (No Download)

Extracted Text (OCR)

From: Sent: To: Cc: Subject: Sunday, August 14, 2016 11:03 AM Jeffrey Epstein Re: Jeffrey, there are several sides to this: 1. Computers that are technically different from our current digital =omputer architectures, but can do the same things, because they can =athematically be proven to be equivalent, and we can build a digital =quivalent. Examples are computers with ternary logic, neural networks, =actor graphs etc. 2. Probabilistic computers: instead of deterministic state transitions, =hey change state with a certain probability. We can get them to =pproximate determinism with arbitrary precision by stacking the =robabilistic gates. Many cognitive scientists and AI researchers =elieve that brains are in that category. (We can also reproduce their =ehavior on a digital computer by adding random noise.) 3. Computers that are technically different from our current digital =omputers, but are still mathematically equivalent, yet it may not be =ractical to build a digital equivalent, because it would be too large =r too slow. Examples are DNA computers, chaotic computers etc. Digital =hysicists ( ) believe that even the universe =s in this category. thinks the brain is in this =ategory (we need to build electronic simulations of spiking neurons). 4. Quantum computers: they still cannot do anything but manipulate =nformation, but they can (hopefully one day) do a few thin s =fficiently, like factoring large numbers, so they are in principle more =owerful than conventional computers. thinks the universe is =n this category, and thinks the brain is in this category. 5. Hypercomputers with true continuum dynamics. Such computers can solve =he 3 body problem with infinite precision in finite time etc. (Most of) =raditional physics believed that the universe must be continuous, and =ven contemporary physics usually has continuous time etc. Such =omputers can be approximated to an arbitrary degree by digital =omputation, but not reproduced exactly. Most computer scientists with =n opinion on the matter think that such hypercomputers cannot exist. 6. Hypercomputers with true infinities, which can use an infinite number =f inputs to compute a result in finite time. For instance, in this =iew, all of the universe (not just a finite amount of information in =ts lightspeed cone) could affect a single point. 7. A-causal computers: For instance, a universe with time machines could =end information that you compute today to help you in your past. =athematically, such computers can be described, but there is no =ndication that they could exist. 0. Reversible computers: A reversible computer cannot delete =nformation, i.e. every state has exactly one preceding state. =eversible computers can be easily implemented in a normal digital =omputer, but a reversible computer that tries to implement a digital =omputer will accumulate entropy in the form of garbage bits. I believe =hat our universe is a reversible computer (our brain is obviously not). The list is not exhaustive, but I think these are the most relevant =ategories of unconventional/alternative computation, from a theoretical =erspective. Additionally, there are notions of things that are "more =han computation" in any of the senses above. They involve referential =emantics, normative/social semantics and other dark magic. and EFTA_R1_01554034 EFTA02453274 many other philosophers believe that our brains and the =niverse do "more than computation", but they do not have good concepts =o explain or formalize their ideas. They probably cannot have such =oncepts, because they would have to leave the domain of mathematics =i.e. formal languages) for them, so there is very little to talk about =xcept for negative claims ("computers cannot do X"). > On Aug 13, 2016, at 15:55, jeffrey E. <jeevacation@gmail.com> wrote: > =ttp://uncomp.uwe.ac.uk/LCCOMP/Anuncios/Entries/2015/8/31_UCNC_2015.ht > ml > On Sat, Aug 13, 2016 at 6:36 AM, > wrote: > Looks interesting. Haven't seen it before. Sounds like =omething would know. » On Aug 13, 2016, at 6:23 AM, jeffrey E. <jeevacation@gmail.com> =rote: » Natural/Unconventional Computing and Its Philosophical Significance - » =DPI MDPI ) pdf » Have you guys looked at this? » -- » please note » The information contained in this communication is confidential, may » be attorney-client privileged, may constitute inside information, and » is intended only for the use of the addressee. It is the property of » JEE Unauthorized use, disclosure or copying of this communication or » any part thereof is strictly prohibited and may be unlawful. If you » have received this communication in error, please notify us » immediately by return e-mail or by e-mail to jeevacation@gmail.com, » and destroy this communication and all copies thereof, including all » attachments. copyright -all rights reserved >> > please note > The information contained in this communication is confidential, may > be attorney-client privileged, may constitute inside information, and > is intended only for the use of the addressee. It is the property of > JEE Unauthorized use, disclosure or copying of this communication or > any part thereof is strictly prohibited and may be unlawful. If you > have received this communication in error, please notify us > immediately by return e-mail or by e-mail to jeevacation@gmail.com, > and destroy this communication and all copies thereof, including all > attachments. copyright -all rights reserved <?xml version=.0" encoding=TF-8"?> 2 EFTA_R1_01554035 EFTA02453275 <!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/Propertylist-1.0.dtd"> <plist version=.0"> <dict> <key>conversation-id</key> <integer>72464</integer> <key>date-last-viewed</key> <integer>0</integer> <key>date-received</key> <integer>1471172571</integer> <key>flags</key> <integer>8590195717</integer> <key>gmail-label-ids</key> <array> <integer>6</integer> <integer>2</integer> </array> <key>remote-id</key> <string>635581</string> </dict> </plist> 3 EFTA_R1_01554036 EFTA02453276

Document Preview

PDF source document
This document was extracted from a PDF. No image preview is available. The OCR text is shown on the left.

Document Details

Filename EFTA02453274.pdf
File Size 272.1 KB
OCR Confidence 85.0%
Has Readable Text Yes
Text Length 6,147 characters
Indexed 2026-02-12T17:19:17.063842
Ask the Files