Securing the Unknown: Theoretical Limits with Big Data
Project and Program:
Enterprise Data Center,
Security and Compliance
Tags:
Proceedings,
SHARE in Anaheim 2014,
2014
Do you think your big data is secure, or any of your data for that matter? Heisenberg’s Uncertainly Principle tells us that we can’t measure exactly. Gödel’s Incompleteness Theorem tells us any sufficiently complex system of expression is capable of having indeterminately true or false assertions (e.g., “This sentence is false.”). The Halting Problem of Alan Turing’s eponymous machines shows that the only way to find out how a sufficiently complex system will behave is to let it run and watch it. And odds are that Schrödinger’s cat’s viability says something about the likelihood and degree of data being usable and secured.
Bring them all together, and join us for a reflective and fun discussion of the conditions and implications as this maps to securing Big Data. There are clues in the cited uncertainty principles.-Brian Cummings; Reg Harbeck-Tata Consultancy Services
Back to Proceedings File Library