tromp

55 ms·

961.
by tromp 3y ago
Death penalty seems inherently barbaric as in practice you cannot avoid executing people who are not found to be innocent until years or decades later. Even if you think guilt can be proven beyond any doubt, I know of no jurisdiction with a
962.
by tromp 3y ago
> Instead of adding two separate angles α and β, we’ll use θ and −θ. It's not clear that the geometric proof based on pictures with positive angles α and β also applies to a negative β. I think one should at least provide a separate
963.
by tromp 3y ago
It's 4x more efficient than an electric heater, but not 4x more than a heat pump [1]. [1] https://en.wikipedia.org/wiki/Coefficient_of_performance
964.
by tromp 3y ago
Cash account is credited $1000, and Gifted (or Cash_Gifted) account is debited $1000.
965.
by tromp 3y ago
Yesterday's discussion on reddit's r/lambdacalculus: [1] https://old.reddit.com/r/lambdacalculus/comments/1byllqk/fra...
966.
by tromp 3y ago
For example, see Joan Stark's art at https://web.archive.org/web/20091028031410/http://www.geocit...
967.
by tromp 3y ago
Your page only mentions > Upper bound estimate of possible legal chess position (counts en passant, castling, sides to move, allows underpromotions): 8.7E+45. But how exactly is this number determined? Is this a sampling based estimate?
968.
by tromp 3y ago
Happy to have authored A094777, Number of legal positions in Go played on an n X n grid (each group must have at least one liberty), [1] and A269417, Number of Go games on n X n board with no repeating position and suicide allowed. [2]. [1]
969.
by tromp 3y ago
Maybe they could demonstrate it by running Shor's algorithm to factor the product of two 4-bit primes, a feat never accomplished.
970.
by tromp 3y ago
Maybe they could demonstrate it by running Shor's algorithm to factor the product of two 4-bit primes, a feat never accomplished.
971.
by tromp 3y ago
Maybe they could demonstrate it by running Shor's algorithm to factor the product of two 4-bit primes, a feat never accomplished.
972.
by tromp 3y ago
Maybe they could demonstrate it by running Shor's algorithm to factor the product of two 4-bit primes, a feat never accomplished.
973.
by tromp 3y ago
> in English whole numbers mean 0, 1, 2, ... According to Wikipedia [1], the term is ambiguous. Its talk page [2] has plenty discussion about it though. [1] https://en.wikipedia.org/wiki/Whole_number [2] https:&#x2
974.
by tromp 3y ago
> For regular chess, I've calculated that there are most legal positions for 29 pieces Improved counting shows the maximum to occur at 28 pieces [1] (also see the issue I filed on your github repo). [1] https://www.chess.
975.
by tromp 3y ago
> avoid the same fate as other EV startups, like recently bankrupt Arrival. Talking about other EV startups, I wonder how much longer Aptera can remain in a state somewhere in between not having gone bankrupt and not having started produ
976.
by tromp 3y ago
The Wikipedia page for Microchess [1] (which the page for the better known Sinclair ZX81 1K Chess [2] links to; would be fun to see a game between these two), contains more interesting tidbits: > Microchess was sold for $10 per copy, in
977.
by tromp 3y ago
> It therefore cannot be used to define a universal complexity for any string. It defines a complexity for anything which can be represented in binary. Which in practice is all we want. Who wants to define a new complexity measure for ev
978.
by tromp 3y ago
Ah, of course. Have not used Linux for so long, I forgot.
979.
by tromp 3y ago
> There is, of course, lambda, "but its usefulness is quite limited and its syntax is frankly a bit cumbersome". I found them useful enough to implement a BLC interpreter [1]. Equally useful as lambda in perl, ruby, and javascr
980.
by tromp 3y ago
Best adventure solvable in 12 turns I ever played. Nicest part was being thrown back to a nostalgic ZX Spectrum BASIC prompt after finishing, and remembering that LIST is under the 'K' key.
981.
by tromp 3y ago
Re-running vagrant up gives Bringing machine 'default' up with 'virtualbox' provider... ==> default: Checking if box 'debian/bookworm64' version '12.20240212.1' is up to date...
982.
by tromp 3y ago
I followed the given instructions on my MacOSX 10.15.7 following brew installs of vagrant and virtualbox, but running vagrant up resulted in ==> default: Clearing any previously set network interfaces... ==> default: Prepari
983.
by tromp 3y ago
KC(x) is always finite for any finite x. What we can say instead is that KC is unbounded. I.e. there is no finite bound on the value of KC(x).
984.
by tromp 3y ago
> cannot print out the string "ABC" When you write a program in any modern programming language to print "ABC", that program merely outputs the 3 bytes 01000001 01000010 01000011, ASCII codes which your console window
985.
by tromp 3y ago
> So what's uncomputable here? Deciding whether the universal machine will ever halt on a particular input. I.e. the good old halting problem.
986.
by tromp 3y ago
Regarding point 1), one can easily show that with probability >= 1 - 2^{-k}, a randomly chosen bitstring x of length n must satisfy KC(x) >= n-k. After all, there are only 1+2+... 2^{n-k-1} = 2^{n-k}-1 shorter descriptions. So highly
987.
by tromp 3y ago
> let’s assume that there exists a universal language U Why not specify it? > That gives us the true language-agnostic definition of Kolmogorov Complexity as follows: Choosing the language of Turing Machines does not make the definiti
988.
by tromp 3y ago
For top level functions maybe, but certainly not for helper functions defined in let ... in, or where clauses.
989.
by tromp 3y ago
> our setup file is approximately 200MB > we keep things as minimal as possible Wonder what's in that file that makes it need to be that large...
990.
by tromp 3y ago
> I still suspect that 5 kilobits should be more than enough for someone actually good at TM golfing. Coincidentally, that is about the size of Penrose's UTM [1] which takes 5495 bits in its own encoding. I suspect that one is only

More ›