Is there any background independent theory of information?

AI Thread Summary
The discussion centers on the concept of a 'bit' in information theory, specifically whether it exists independently or only in the context of two systems exchanging information. The idea posits that a 'bit' cannot be isolated and is meaningful only when considered in relation to another system. The Shannon-Wiener entropy (H) is referenced as a relevant framework that aligns with this perspective, suggesting that information is fundamentally relational and dependent on the interaction between systems. This highlights a shift in understanding information not as a standalone entity but as something that emerges through communication and exchange.
divadwg
Messages
2
Reaction score
0
Is there any theory of information that considers a 'bit' to be something that only exists relative to a pair of systems exchanging information? I.E there is no such thing as an isolated 'bit'.
 
Technology news on Phys.org
Do you mean something like the Shannon-Wiener H? That seems to match what you are asking.
 
Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...
What percentage of programmers have learned to touch type? Have you? Do you think it's important, not just for programming, but for more-than-casual computer users generally? ChatGPT didn't have much on it ("Research indicates that less than 20% of people can touch type fluently, with many relying on the hunt-and-peck method for typing ."). 'Hunt-and-peck method' made me smile. It added, "For programmers, touch typing is a valuable skill that can enhance speed, accuracy, and focus. While...
I had a Microsoft Technical interview this past Friday, the question I was asked was this : How do you find the middle value for a dataset that is too big to fit in RAM? I was not able to figure this out during the interview, but I have been look in this all weekend and I read something online that said it can be done at O(N) using something called the counting sort histogram algorithm ( I did not learn that in my advanced data structures and algorithms class). I have watched some youtube...
Back
Top