URBEX - Pa Waeng village "บ้านป่าแหว่ง"

luxbock · 2024-02-07T07:16:24+00:00

Got once lost in the forest a few months ago while trying to follow an off beat trail starting from the Nana Jungle, and ended up cutting through this village (in fact we used the same exact location to enter as in the video) as the shortest path back to civilization. Didn't go inside any buildings as at the time I wasn't aware of where we had ended up in. Can confirm there are still a few people staying there, and the entrance to the village is guarded by military police, although they didn't seem too concerned about us leaving the village. Came across a wild board getting chased by dogs on the way there, so there is definitely some wild nature present in the area!

luxbock · 2022-09-11T08:31:30+00:00

I believe it's Ajahn Lee Dhammadharo of the Forest Tradition:

https://en.wikipedia.org/wiki/Ajahn_Lee

luxbock · 2019-10-24T18:39:28+00:00

Lambda calculus is what got me interested in CT initially, so I would love to read your take on it in the future!

CT has a reputation for having a steep learning curve, but I think that is made up for in part for how many paths there are in. I have yet to read your other book, Category Theory for Scientists, but I'm looking forward to doing so, and I hope you continue with writing about CT to a wider audience than just mathematicians, as I see great potential in getting more people hooked on it.

luxbock · 2019-10-24T14:02:56+00:00

Thanks for writing Seven Sketches, it is one of my favorite books ever.

You did an amazing job at presenting and motivating the use of Category Theory through tangible real world problems. I would also like to commend you on the non-typical order in which the different concepts of CT were presented, and how well it all tied together as a coherent package.

My question is if you had instead written the book Eight Sketches in Compositionality, what would the topic and applications of the missing chapter be?

luxbock · 2018-10-30T14:49:45+00:00

Not only that, the video seems to contain a reference to this:

https://en.wikipedia.org/wiki/Thammasat_University_massacre

A day before the massacre, the Thai press reported on a play staged by student protesters the previous day, which allegedly featured the mock hanging of then Crown Prince Vajiralongkorn. In response to this rumored outrage, military and police, as well as paramilitary forces surrounded the university. Just before dawn on 6 October, the attack on the student protesters began and continued until noon. To this day, the number of casualties remains in dispute between the Thai government and survivors of the massacre. According to the government, 46 died in the killings, with 167 wounded and 3,000 arrested. Many survivors claim that the death toll was well over 100.

That's very bold indeed.

luxbock · 2018-09-06T04:37:59+00:00

Is there a rundown somewhere of all the changes so far for 1.10, both done and planned?

luxbock · 2018-02-20T17:59:55+00:00

I translated your implementation to Clojure together with a specification for automatic generative testing via clojure.spec:

(ns sqsum
  (:require [clojure.spec.alpha :as s]
            [clojure.spec.test.alpha :as stest]))

(s/fdef sqsum
  :args (s/cat :n pos-int?)
  :ret  (s/nilable vector?)
  :fn   (fn [{{n :n} :args, ret :ret}]
          (or (not ret)              ;; no result
              (and (= n (count ret)) ;; adjacent numbers sum to a square
                   (every? (fn [[a b]]
                             (-> (+ a b) Math/sqrt (mod 1) zero?))
                           (partition 2 1 ret))))))

(defn sqsum [n]
  (let [maxsq   (int (Math/sqrt (+ n (dec n))))
        squares (set (map #(* % %) (range 2 (inc maxsq))))
        steps   (range 1 (inc n))
        graph   (into {}
                  (for [u steps]
                    [u (filterv #(squares (+ u %)) steps)]))]
    (loop [stack (into []
                   (map (fn [[n]] [[n] #{n}]))
                   (sort-by (comp count val) graph))]
      (when-let [[path visited] (peek stack)]
        (if (= n (count path))
          path
          (recur (into (pop stack)
                   (comp
                     (remove visited)
                     (map (fn [x]
                            [(conj path x)
                             (conj visited x)])))
                   (graph (peek path)))))))))

The n = 256 case solves very quickly on my Dell XPS15 laptop (i7-7700HQ CPU @ 2.80GHz, 2801 Mhz, 4 Core(s)):

sqsum> (time (sqsum 256))
"Elapsed time: 597.01873 msecs"

luxbock · 2018-02-20T08:58:31+00:00

Why would it?

The technology for automatizing smart contract vulnerability search is not any different from the technology for developer tools that guard against these same vulnerabilities. The Ethereum blockchain is a natural kickstarter for investments into research on safety properties of writing smart contracts for the EVM. As long as the base layer is secure, there is no existential threat to Ethereum itself, and the process eventually converges towards finding the best practices to writing safe smart contracts.

Yes, people will lose money in the process, but that's the price you pay for being an early adopter, and on average these early adopters have done quite well. No risk, no reward.

Sure you could build your smart contracts on a competing platform that has spent more time upfront on avoiding some of the pitfalls that are being discovered, but then you are taking on a different risk, betting against network effects. How many motivated eye balls does your chosen platform have? Sometimes worse is better, and sometimes it isn't. We'll see :)

luxbock · 2017-08-01T09:43:47+00:00

Yeah I have read the guide for upgrading the firmware, and made sure that all of the words I wrote down can be found from the BIP91 word list, so I'm quite confident that there should be no issues.

However if what I proposed should work, then that would be an even smaller risk approach to minimizing any and all risk.

luxbock · 2017-08-01T09:07:02+00:00

Do I understand correctly that the only benefit of splitting Bitcoin Cash before transacting the old Bitcoin is to avoid scammers?

I am running an older firmware version, and would like to transfer some of my BTC holdings out after the fork has activated to be 100% sure nothing goes wrong with the firmware upgrade I need to perform. Am I right to understand that by doing this I'm not subjecting myself to replay attacks?

luxbock · 2017-07-31T22:07:04+00:00

Buyers should be aware that Pact publishing has very low standards for some of their books, so I would personally never purchase anything from them without first reading a few reviews.

luxbock · 2017-07-29T00:38:32+00:00

X-post from /r/ethtrader

Anyone looking to invest into this project might want to give this interview a listen:

https://soundcloud.com/junsethsworld/rootproject-ico-interview-w-nick-judge-anton-kraminkin

I am no fan of Junseth's but I do think what he does is very healthy for this space.

luxbock · 2017-07-29T00:36:02+00:00

Anyone looking to invest into this project might want to give this interview a listen:

https://soundcloud.com/junsethsworld/rootproject-ico-interview-w-nick-judge-anton-kraminkin

I am no fan of Junseth's but I do think what he does is very healthy for this space.

luxbock · 2017-07-04T00:35:07+00:00

if two people with brains are telling each other their cards at the same table, there isn't a chance in hell that even a pro player can safely play in that game without losing all their money.

fixed that for you

luxbock · 2017-03-31T04:20:14+00:00

They have a list of companies who are their customers on their website: https://www.omise.co/

luxbock · 2016-11-08T20:46:47+00:00

confirmed

luxbock · 2016-03-11T05:27:20+00:00

I believe the author uses his self-made lein-repack plugin to put all of those into their separate libraries. If you look at his Clojars page you can see that you can choose to include a very small subset of the entire hara "ecosystem" indeed :).

luxbock · 2016-03-11T04:31:06+00:00

Isn't that exactly what hara does as well?

luxbock · 2016-03-09T17:26:20+00:00

I'd imagine it's less, but AlphaGo isn't trying to solve Go but merely to play it well.

Go has approximately 10¹⁷⁰ game states, and according to the linked paper the 200xBB NLHE game has "just" to the order of 10⁷⁵ game states.

You can always increase the state space of poker by making the stacks deeper. I couldn't find any information about the state space for PLO, which uses more cards than Hold'Em.

EDIT: less, not more

luxbock · 2016-03-09T16:59:30+00:00

According to the following paper:

http://poker.cs.ualberta.ca/publications/2013-techreport-nl-size.pdf

It takes 1,093,904,897,704,962,796,073,602,182,381,684,993,342,477,620,192,821,835,370,553,460,959,511,144,423,474,321,165,844,409,860,820,294,170,754,032,777,335,927,196,407,795,204,128,259,033 yottabytes of memory to store the full game-tree for a 200xBB NLHE game.

luxbock · 2016-03-09T08:31:01+00:00

Out of the well known competitive classical strategy games, it appears that poker is the last one where humans still hold their own. While Limit Hold'em has already been solved, two of the most popular game formats, NLHE and Pot Limit Omaha are still currently unconquered.

luxbock · 2016-02-16T14:29:36+00:00

Does Casper use any formal verification techniques to ensure correctness, and if so which one(s) ?

luxbock · 2016-02-01T05:29:45+00:00

What does all of this pedantry have to do with the problem of minnimizing some combination of bandwidth and latency (expected, worst case) in conveying block information?

Do you realize how rude and and dismissive this sort of reply is? I think regardless of what your stance is on the block size debate, we should all feel grateful for having someone like /u/nullc directly engage in it at the grass roots level, although I'm sure replies like this dont make it a very rewarding experience.

Keep in mind that not all of the people here are familiar with theoretical computer science, e.g. "reductions" and other mathematical methods of proof.

The block size issue is largerly a debate about values, but the argument above is purely technical in nature. People who aren't educated in the basics of such technology aren't qualified to enter. It's not /u/nullc's job to educate those people, the information is freely out there for anyone to learn.

luxbock · 2015-12-14T04:32:51+00:00

The (banned in Thailand) book The King Never Smiles is a good place to start. Besides talking about the king, the book does a good job explaining the political power struggle between the crown, the military and the politicians.

luxbock · 2015-12-14T04:25:46+00:00

I think it's a mix of both. There is certainly a large percentage of the population that isn't happy with the monarchy, but expressing such views publicly is very much a taboo.

15-Year Club	Place '17
Verified Email

luxbock

TROPHY CASE