cca_keyspin's Avatar

cca_keyspin

@ccakeyspin

^o^ as known on other sites

18
Followers
56
Following
70
Posts
03.05.2025
Joined
Posts Following

Latest posts by cca_keyspin @ccakeyspin

no one on here in 2026 huh... I see how it is

17.01.2026 21:34 πŸ‘ 1 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

have niche interests and be interesting
go on an adventure
go to unexplored places
otherwise what's the point of traveling
you are collecting stories for the future
vibe
just be a romantic at heart

12.01.2026 19:43 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0
Post image

how to study math

(does this qualify as a special subgenre of mathematician art / nerdy aesthetic)

12.01.2026 19:42 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

couple writing their initials in a heart with their shoes in freshly fallen snow

I wonder if romance is all about doing cheesy stuff together like this

19.12.2025 20:49 πŸ‘ 1 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

does anyone even use this site

19.12.2025 20:49 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0
Report: Internet can make you lonely, depressed
August 30, 1998
Web posted at: 6:47 p.m. EDT (2247 GMT)
NEW YORK (CNN) -- Internet users who spend even a few hours a week online at home experience higher levels of depression and loneliness than if they had used the computer network less frequently, The New York Times reported Sunday.
The result of the two-year study by Carnegie Mellon University on the social and psychological effects of Internet use at home surprised both researchers and sponsors, which included Intel Corp., Hewlett Packard, AT&T Research and Apple Computer.
"We were shocked by the findings, because they are counterintuitive to what we know about how socially the Internet is being used," Robert Kraut, a social psychology professor at Carnegie Mellon's Human Computer Interaction Institute, told the newspaper.
"We are not talking here about the extremes. These were normal adults and their families, and on average, for those who used the Internet most, things got worse," he said.
Even though participants in the study used inherently social features such as e-mail and chat rooms, they observed a decline in interaction with family members and a reduction in their circles of friends that directly corresponded to the amount of time they spent online, the Times reported.
The new study, title "HomeNet," suggests that the interactive medium may be no more socially healthy than older forms of mass media, and questions the nature of "virtual" communication and the disembodied relationship that are often formed in the vacuum of cyberspace, according to the newspaper.
"Our hypothesis is there are more cases where you're building shallow relationships, leading to an overall decline in feeling of connection to other people," Kraut was quoted as saying.

Report: Internet can make you lonely, depressed August 30, 1998 Web posted at: 6:47 p.m. EDT (2247 GMT) NEW YORK (CNN) -- Internet users who spend even a few hours a week online at home experience higher levels of depression and loneliness than if they had used the computer network less frequently, The New York Times reported Sunday. The result of the two-year study by Carnegie Mellon University on the social and psychological effects of Internet use at home surprised both researchers and sponsors, which included Intel Corp., Hewlett Packard, AT&T Research and Apple Computer. "We were shocked by the findings, because they are counterintuitive to what we know about how socially the Internet is being used," Robert Kraut, a social psychology professor at Carnegie Mellon's Human Computer Interaction Institute, told the newspaper. "We are not talking here about the extremes. These were normal adults and their families, and on average, for those who used the Internet most, things got worse," he said. Even though participants in the study used inherently social features such as e-mail and chat rooms, they observed a decline in interaction with family members and a reduction in their circles of friends that directly corresponded to the amount of time they spent online, the Times reported. The new study, title "HomeNet," suggests that the interactive medium may be no more socially healthy than older forms of mass media, and questions the nature of "virtual" communication and the disembodied relationship that are often formed in the vacuum of cyberspace, according to the newspaper. "Our hypothesis is there are more cases where you're building shallow relationships, leading to an overall decline in feeling of connection to other people," Kraut was quoted as saying.

August 30, 1998 report:
Internet can make you lonely, depressed
www.cnn.com/TECH/computi...

12.11.2025 04:52 πŸ‘ 0 πŸ” 1 πŸ’¬ 0 πŸ“Œ 0
Programming Considered as a Human Activity.
by
Edsger W. Dijkstra
1. Introduction.
By way of introduction I should like to start this talk with a story and a quotation.
The story is about the physicist Ludwig Boltzmann, who was willing to reach his goals by lengthy computations. Once somebody complained about the ugliness of his methods, upon which complaint Boltzmann defended his way of working by stating that "elegance was the concern of tailors and shoemakers", implying that he refused to be troubled by it.
In contrast I should like to quote another famous nineteenth century scientist, George Boole. In the middle of his book "An Investigation of the Laws of Thought" in a chapter titled "Of the Conditions of a Perfect Method." he writes: "I do not here speak of that perfection only which consists in power, but of that also which is founded in the conception of what is fit and beautiful. It is probable that a careful analysis of this question would conduct us to some such conclusion as the following, viz., that a perfect method should not only be an efficient one, as respects the accomplishment of the objects for which it is designed, but should in all its parts and processes manifest a certain unity and harmony". A difference in

Programming Considered as a Human Activity. by Edsger W. Dijkstra 1. Introduction. By way of introduction I should like to start this talk with a story and a quotation. The story is about the physicist Ludwig Boltzmann, who was willing to reach his goals by lengthy computations. Once somebody complained about the ugliness of his methods, upon which complaint Boltzmann defended his way of working by stating that "elegance was the concern of tailors and shoemakers", implying that he refused to be troubled by it. In contrast I should like to quote another famous nineteenth century scientist, George Boole. In the middle of his book "An Investigation of the Laws of Thought" in a chapter titled "Of the Conditions of a Perfect Method." he writes: "I do not here speak of that perfection only which consists in power, but of that also which is founded in the conception of what is fit and beautiful. It is probable that a careful analysis of this question would conduct us to some such conclusion as the following, viz., that a perfect method should not only be an efficient one, as respects the accomplishment of the objects for which it is designed, but should in all its parts and processes manifest a certain unity and harmony". A difference in

attitude one can hardly fail to notice.
Our unconscious association of elegance with luxury may be one of the origins of the not unusual tacit assumption that it costs to be elegant. To show that it also pays to be elegant is one of my prime purposes. It will give us a clearer understanding of the true nature of the quality of programs and the way in which they are expressed, viz. the programming language. From this insight we shall try to derive some clues as to which programming language features are most desirable. Finally we hope to convince you that the different aims are less conflicting with one another than they might thought to be at first sight.
2. On the Quality of the results.
Even under the assumption of flawlessly working machines we should ask ourselves the questions: "When an automatic computer produces results, why do we trust them, if we do so?" and after that; "What measures can we take to increase our confidence that the results produced are indeed the results intended?"
How urgent the first question is might be illustrated by a simple, be it somewhat simplified example. Suppose that a mathematician interested in number theory has at his disposal a machine with a program to factorize numbers. This process may end in one of two ways: either it gives a factorization of the number given or it answers that the number given is prime. Suppose now that our mathematician

attitude one can hardly fail to notice. Our unconscious association of elegance with luxury may be one of the origins of the not unusual tacit assumption that it costs to be elegant. To show that it also pays to be elegant is one of my prime purposes. It will give us a clearer understanding of the true nature of the quality of programs and the way in which they are expressed, viz. the programming language. From this insight we shall try to derive some clues as to which programming language features are most desirable. Finally we hope to convince you that the different aims are less conflicting with one another than they might thought to be at first sight. 2. On the Quality of the results. Even under the assumption of flawlessly working machines we should ask ourselves the questions: "When an automatic computer produces results, why do we trust them, if we do so?" and after that; "What measures can we take to increase our confidence that the results produced are indeed the results intended?" How urgent the first question is might be illustrated by a simple, be it somewhat simplified example. Suppose that a mathematician interested in number theory has at his disposal a machine with a program to factorize numbers. This process may end in one of two ways: either it gives a factorization of the number given or it answers that the number given is prime. Suppose now that our mathematician

wishes to subject to this process a, say, 20 decimal number, while he has strong reasons to suppose that it is a prime number. If the machine confirms this expectation, he will be happy; if it finds a factorization, the mathematician may be disappointed because his intuition has fooled him again, but, when doubtful, he can take a desk machine and can multiply the factors produced in order to check whether the product reproduces the original number. The situation is drastically changed, however, if he expects the number given to be non-prime: if the machine now produces factors he finds his expectations confirmed and moreover he can check the result by multiplying. If, however, the machine comes back with the answer that the number given is, contrary to his expectations and warmest wishes, alas a prime number, why on earth should he believe this?
Our example shows that even in completely discrete problems the computation of a result is not a well-defined job, well-defined in the sense that one can say: "I have done it." without paying attention the convincing power of the result, viz. to its "quality".
The programmer's situation is closely analogous to that of the pure mathematician, who develops a theory and proves results. For a long time pure mathematicians have thought β€”and some of them still thinkβ€” that a theorem can be proved completely, that the question whether a supposed proof for a theorem is sufficient or not, admits an absolute answer "yes" or "no". But this is

wishes to subject to this process a, say, 20 decimal number, while he has strong reasons to suppose that it is a prime number. If the machine confirms this expectation, he will be happy; if it finds a factorization, the mathematician may be disappointed because his intuition has fooled him again, but, when doubtful, he can take a desk machine and can multiply the factors produced in order to check whether the product reproduces the original number. The situation is drastically changed, however, if he expects the number given to be non-prime: if the machine now produces factors he finds his expectations confirmed and moreover he can check the result by multiplying. If, however, the machine comes back with the answer that the number given is, contrary to his expectations and warmest wishes, alas a prime number, why on earth should he believe this? Our example shows that even in completely discrete problems the computation of a result is not a well-defined job, well-defined in the sense that one can say: "I have done it." without paying attention the convincing power of the result, viz. to its "quality". The programmer's situation is closely analogous to that of the pure mathematician, who develops a theory and proves results. For a long time pure mathematicians have thought β€”and some of them still thinkβ€” that a theorem can be proved completely, that the question whether a supposed proof for a theorem is sufficient or not, admits an absolute answer "yes" or "no". But this is

an illusion, for as soon as one thinks that one has proved something, one has still the duty to prove that the first proof was flawless, and so on, ad infinitum! One can never guarantee that a proof is correct, the best one can say, is: "I have not discovered any mistakes". We sometimes flatter ourselves with the idea of giving watertight proofs, but in fact we do nothing but make the correctness of our conclusions plausible. So extremely plausible, that the analogy may serve as a great source of inspiration.
In spite of all its deficiencies, mathematical reasoning presents an outstanding model of how to grasp extremely complicated structures with a brain of limited capacity. And it seems worthwhile to investigate to what extent these proven methods can be transplanted to the art of computer usage. In the design of programming languages one can let oneself be guided primarily by considering "what the machine can do". Considering, however, that the programming language is the bridge between the user and the machine β€”that it can, in fact, be regarded as his toolβ€” it seems just as important to take into consideration "what Man can think". It is in this vein that we shall continue our investigations.
3. On the structure of convincing programs.
The technique of mastering complexity is known since ancient times: "Divide et impera" ("Divide and rule"). The analogy between proof construction and program construction is, again, striking. In both cases the available starting

an illusion, for as soon as one thinks that one has proved something, one has still the duty to prove that the first proof was flawless, and so on, ad infinitum! One can never guarantee that a proof is correct, the best one can say, is: "I have not discovered any mistakes". We sometimes flatter ourselves with the idea of giving watertight proofs, but in fact we do nothing but make the correctness of our conclusions plausible. So extremely plausible, that the analogy may serve as a great source of inspiration. In spite of all its deficiencies, mathematical reasoning presents an outstanding model of how to grasp extremely complicated structures with a brain of limited capacity. And it seems worthwhile to investigate to what extent these proven methods can be transplanted to the art of computer usage. In the design of programming languages one can let oneself be guided primarily by considering "what the machine can do". Considering, however, that the programming language is the bridge between the user and the machine β€”that it can, in fact, be regarded as his toolβ€” it seems just as important to take into consideration "what Man can think". It is in this vein that we shall continue our investigations. 3. On the structure of convincing programs. The technique of mastering complexity is known since ancient times: "Divide et impera" ("Divide and rule"). The analogy between proof construction and program construction is, again, striking. In both cases the available starting

Edsger W. Dijkstra - Programming Considered as a Human Activity (1965)

"The programmer's situation is closely analogous to that of the pure mathematician, who develops a theory and proves results."

www.cs.utexas.edu/~EWD/ewd01xx...
www.cs.utexas.edu/~EWD/transcr...

12.11.2025 04:48 πŸ‘ 1 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

it's interesting that the little mundane imprints of our everyday will one day feel nostalgic to us

11.11.2025 05:33 πŸ‘ 1 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

you got this

09.11.2025 17:44 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

won't you try hard for the sake of someone you love?
so much is at stake
now is not the time to give up :/

09.11.2025 17:43 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

sometimes i wonder to myself what i am even doing with my life

09.11.2025 17:42 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

it's so interesting how game theory and graph theory are related

06.11.2025 18:52 πŸ‘ 2 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

I remember someone shared some article from the one of the rationalist circles which compared the lives of 1000 insects vs 1 human being

would killing 1000 or 1 million insects be equivalent to murder? the article in typical fashion tried to model this ratio numerically

06.11.2025 18:51 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

maybe it would be reborn as a bee in its next life :/

is it lacking in compassion to kill mosquitoes or is it self defense?

our anthropocentric form of ethics prioritizes human lives, natural self preservation

but is there any other basis of that other than self life-will

06.11.2025 18:51 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

by some chance I managed to slap & gravely injure a mosquito that was drinking my blood, but it didn't die, it was twitching in my hand

I suddenly felt that this small life was so fragile and released it outside my window

but maybe I should have ended its suffering right there

06.11.2025 18:51 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

interesting to see what websites break without javascript lol

it also supports gopher, gemini, manpage protocols…

it also keeps to its roots by allowing you to use a user stylesheet and choose to not use the external css stylesheets from the webpage

and plugins can be customized using C/bash/css

06.11.2025 18:48 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0
Post image

so there is a 25 year old graphical browser called "dillo" that is still under 2mb in size

caveat being it doesn't support javascript, but it does support html+css

the ui still looks original as well...

news.ycombinator.com/item?id=4582...

06.11.2025 18:48 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0
Cryptographers seldom sleep well([M]). Their
careers are frequently based on very precise
complexity-theoretic assumptions, which could be
shattered the next morning. A polynomial time
algorithm for factoring would certainly prove more
crushing than any paltry fluctuation of the Dow
Jones. The effect a proof that P = NP would
have is unspeakable.

Cryptographers seldom sleep well([M]). Their careers are frequently based on very precise complexity-theoretic assumptions, which could be shattered the next morning. A polynomial time algorithm for factoring would certainly prove more crushing than any paltry fluctuation of the Dow Jones. The effect a proof that P = NP would have is unspeakable.

cryptographers seldom sleep well (from paper by Kilian 1988 "founding cryptography on oblivious transfer" doi.org/10.1145/62212.62215)

06.11.2025 18:13 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

school is a magical place where everyone is young and beautiful and pretends and believes that they can achieve their dreams

24.10.2025 06:09 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

got a new phishing text that was clever, it gives a fake verification code and asks you to report it to (a fake URL) if you didn't initiate the request (where presumably you would verify/ "log in" to a fake site)

funny as this type of 2fa text when legit is meant to prevent this

24.10.2025 06:09 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0
Millions long for immortality who do not know what to do with themselves on a rainy Sunday afternoon. (Susan Ertz, β€œAnger in the Sky”)

Millions long for immortality who do not know what to do with themselves on a rainy Sunday afternoon. (Susan Ertz, β€œAnger in the Sky”)

terrytao.wordpress.com/career-advic...

24.10.2025 06:07 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0
Shockingly Effective Trick To Maximize your Margin!!!

Dr Vapnik, the authority on everything related to statistical learning theory, set out to do some research and determine whether these techniques live up to their reputations. After several weeks Vladimir was able to report back on several of his findings. The most exciting of which was he now is going to improve accuracy by .8 over the next year.

Based on these findings it is evident the only way to get the empirical risk you deserve is to take matters into your own hands. Smart machine learners already know this, and as a result are using our one weird trick to receive unbiased empircal risk estimates fast and hassle free.

http://www.oneweirdkerneltrick.com

Shockingly Effective Trick To Maximize your Margin!!! Dr Vapnik, the authority on everything related to statistical learning theory, set out to do some research and determine whether these techniques live up to their reputations. After several weeks Vladimir was able to report back on several of his findings. The most exciting of which was he now is going to improve accuracy by .8 over the next year. Based on these findings it is evident the only way to get the empirical risk you deserve is to take matters into your own hands. Smart machine learners already know this, and as a result are using our one weird trick to receive unbiased empircal risk estimates fast and hassle free. http://www.oneweirdkerneltrick.com

Cat Basis Purrsuit
Daniel Caturana dimatura@cmu.edu
David Furry dfouhey@cs.cmu.edu
Abstract
Meow miao mew meow mew meow mew mew meow miao meow meow mew meow meow miau mew miao meeeow meow, miau meow miao mew meeeeow mew miao miao miao. Meow miao mew meow mew (MMM), meow miao mew meow mew meow, meow meow miao meow state-of-the-art meow meow.
Mew mew meow miao miao nyan nyan meow mew. Meow meow miauw meow miao mew meow, meiau meow meow mew miaou miiiaou. Miao meow meow mew miao meow meow miao miao miau meow miau: meow meow mew mew MMM meow miu meow meow nyan meow mew meow. 
1. Introduction
Everyone loves cats.
2. Related work
Fueled by the desire to take advantage of the Internet’s cat lust, the last few years have seen a great deal of feline-related work from the machine learning and computer vision communities. These have ranged from attempts to simulate a cat brain (Ananthanarayanan et al., 2009) to using massive amounts of grad students and computational resources to build visual cat detectors (Le et al., 2011; Fleuret & Geman, 2008; Parkhi et al., 2012). In this paper we hope to take advantage of people’s fascination for cats to achieve recognition and adoration for minimum amounts of work.
3. Method
One method is to use purrincipal catponent analysis, in which we build a pawsitive definite matrix and extract its eigenvectors. But the problem is that it is not spurrse. We want a spurrse basis 1 . To get the spurrse basis we use the latest in optimization algorithms, Cat Swarm Optimization (CSO) (Chu et al., 2006). A variant of Particle Swarm Optimization (PSO) (Kennedy & Eberhart, 1995), CSO has been used on many applications, including system identification (Panda et al., 2011) and clustering (Santosa & Ningrum, 2009). CSO is based on the behavior of cats. 

https://www.oneweirdkerneltrick.com/catbasis.pdf

Cat Basis Purrsuit Daniel Caturana dimatura@cmu.edu David Furry dfouhey@cs.cmu.edu Abstract Meow miao mew meow mew meow mew mew meow miao meow meow mew meow meow miau mew miao meeeow meow, miau meow miao mew meeeeow mew miao miao miao. Meow miao mew meow mew (MMM), meow miao mew meow mew meow, meow meow miao meow state-of-the-art meow meow. Mew mew meow miao miao nyan nyan meow mew. Meow meow miauw meow miao mew meow, meiau meow meow mew miaou miiiaou. Miao meow meow mew miao meow meow miao miao miau meow miau: meow meow mew mew MMM meow miu meow meow nyan meow mew meow. 1. Introduction Everyone loves cats. 2. Related work Fueled by the desire to take advantage of the Internet’s cat lust, the last few years have seen a great deal of feline-related work from the machine learning and computer vision communities. These have ranged from attempts to simulate a cat brain (Ananthanarayanan et al., 2009) to using massive amounts of grad students and computational resources to build visual cat detectors (Le et al., 2011; Fleuret & Geman, 2008; Parkhi et al., 2012). In this paper we hope to take advantage of people’s fascination for cats to achieve recognition and adoration for minimum amounts of work. 3. Method One method is to use purrincipal catponent analysis, in which we build a pawsitive definite matrix and extract its eigenvectors. But the problem is that it is not spurrse. We want a spurrse basis 1 . To get the spurrse basis we use the latest in optimization algorithms, Cat Swarm Optimization (CSO) (Chu et al., 2006). A variant of Particle Swarm Optimization (PSO) (Kennedy & Eberhart, 1995), CSO has been used on many applications, including system identification (Panda et al., 2011) and clustering (Santosa & Ningrum, 2009). CSO is based on the behavior of cats. https://www.oneweirdkerneltrick.com/catbasis.pdf

Our approach: Stochastic Weighted
Aggregation
Algorithm 1 you only learn once / online learning
initialize regret Rt ← 0
t ← 1
for t = 1 to death do
something happens xt
post tumblr yt ← f(xt, yt)
receive loss function `t(yt)
update regret Rt ← Rtβˆ’1 + `t(yt) Rt ← 0 yolo lol
t ← t + 1
end for
Regret asymptotically tends to 0

https://www.oneweirdkerneltrick.com/part1.pdf

Our approach: Stochastic Weighted Aggregation Algorithm 1 you only learn once / online learning initialize regret Rt ← 0 t ← 1 for t = 1 to death do something happens xt post tumblr yt ← f(xt, yt) receive loss function `t(yt) update regret Rt ← Rtβˆ’1 + `t(yt) Rt ← 0 yolo lol t ← t + 1 end for Regret asymptotically tends to 0 https://www.oneweirdkerneltrick.com/part1.pdf

computer scientists used to be funny

(www.oneweirdkerneltrick.com)

17.10.2025 03:38 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

I found online that there is another aspect to consider in context of the "Grossman-Stiglitz paradox" which is the cost of collecting information

and the general impossibility of perfectly efficient pricing realization in the real world

05.10.2025 18:37 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0
Preview
GΓΆdel on pure mathematics and medieval theology I was watching this youtube video recently where Gregory Chaitin paraphrases something from one of GΓΆdel's unpublished essays (apparently published now). It is at the 4:48 mark of the video Gregory

"is mathematics invented or discovered?"
mathoverflow.net/questions/37...

05.10.2025 04:49 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

in the real world we do not even have access to granular pricing oracles for individual consumers (who may be difficult to track due to paying cash, physical constraints such as traffic, etc) vs online e-commerce which provides real-time valuation

04.10.2025 22:21 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

it seems to present as a local market inefficiency constrained by physical reality or perhaps physical stores in price-setting mechanisms must profit margin which maximizes over the *average consumer* but eschews more "efficient" (for the seller) pricing

04.10.2025 22:21 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

physical stores are constrained in how often they can change prices and the prices are uniform for all in-store patrons

but local valuation may be higher (willing to pay more) for a customer who eg has to travel a longer time

ofc this may all be anti consumer but is interesting

04.10.2025 22:21 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

however online ecommerce often *does* present individualized prices and "discounts" based on user heuristics, buying habits, etc

also use of dark patterns such as countdown timers for discounts etc which impose urgency thus raising the customer's likelihood of buying

04.10.2025 22:21 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

something which strikes me as different between online ecommerce and physical stores is pricing efficiency

essentially as different customers may place different valuations on convenience, travel time, etc, physical store pricing does not consider different customers priorities

04.10.2025 22:21 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 1

so supposedly the only place in the world with free bloomberg terminal access is the NY public library (yeah universities also have it but tuition isn't always free)

04.10.2025 22:20 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0