So be it, but it is a useless definition of exists then isn't it?
1,233 karma · joined July 3, 2012
So be it, but it is a useless definition of exists then isn't it?
This is how natural numbers work in the first place. You're just adding a decimal point to all of the possible places it could go.
Neither. That's my point. Literally any definition of something infinite can always be reduced to a procedure that recursively transforms or observes some prior state. To say that one of these functions can produce more distinct states than another is pointless, because the procedure that produces the most states will always be the one that you ran the most times.
There is nothing observably infinite, since it would take infinite time to observe that any given thing was infinite. The only possible proof of infinity would be a machine that runs infinitely quickly. e.g. https://qntm.org/responsibility
The diagonal proof is just arguing that two nested while(true) loops will run for longer than one. (And then we define this as "bigger" just to confuse undergraduates)
Gimp is a wonderful piece of free software that I use often, and I greatly appreciate the work and time the maintainers are putting into it.
It's those design choices that are subject to all of the dilemmas that necessitate schools of thought such as those in "A Philosophy of Software Design". The mathematics hasn't been invented yet to determined the most efficient way to lay out complex software. And it won't be until long after our jobs are all replaced by fuzzy AI. Until then, software development is a performance art subject to many different schools of thought or philosophies of design, and you're fooling yourself if you think that you can escape from them.
At the end of the day, there is no mathematical formula to choose which color the border of a selected text-input should be: Only conventions, design philosophies, tastes and opinions.
The book you've linked (although I haven't read it all yet), provides a design philosophy for approaching a subset of the problems that computer programmers face. But: It doesn't have any writing on the hardest problems that programmers face in regards to IO and managing persistent state in a concurrent-access environment.
Given ten different calculuses with completely different syntaxes and modes of expression, (for example lamba calculus, combinatory calculus, a Turing machine, a type inference calculus, euclidean geometry, ultrafinitism), each and every one of these ought to be able to express a formal theory that is equivalent. When you are writing software based upon some theory, which calculus will you use to express it? A giant tree of lambdas? A state machine? Pure functions? Mathematically they are all proven to be equivalent so you must make a practical decision based on which one that you believe is best for the job. How will you make that decision? Most likely you will follow some set of personal heuristics that in your experience have shown one form of expression is easier for you than others. And thus you are adopting some philosophy of software even if you try tell yourself that you aren't.