deanmen

Location: Texas, USA Remote: OK Willing to relocate: Yes

Email: dean.menezes [at] utexas.edu

Résumé/CV: https://github.com/menezesd/hello-world/blob/master/Tech_Res...

Technologies: C++, C, Rust, Python, JavaScript, Java, Rust, SQL

The price is determined by SUPPLY and demand, and being able to write software quickly using LLMS would move the supply curve.

Yes, in many European countries dependents and marital status changes are registered in a national civil registry, which the tax authority can query directly.

Countries like the U.S., Canada, the U.K. cannot easily do that without huge data-sharing reforms.

Nowadays maybe they could get Ozempic?

Location: Corpus Christi, TX

Remote : Yes

Willing to Relocate: Yes

Resume: https://github.com/menezesd/hello-world/blob/master/Tech_Res...

email: dean.menezes@utexas.edu

Technologies: C++, C, Python, Rust

I am a software engineer with a masters degree in math with a good knowledge of various systems concepts (CPU architecture, multithreading, OS, memory management, optimization). I enjoy working an software problems that challenge me to write mathematicalyl sophisticated code that respects the reality of executing that code on a physical machine.

Languages: Python, Java, C++, Spark, Scala, SQL.

Python Libraries: Numpy, Keras, TensorFlow, Seaborn, Matplotlib, Plotly, NLP, NLTK, spaCY, GeoPy, Geopandas, SciPy.

Tools: Linux, bash, Google Cloud Platform, APIs, datasets GPT, Snowflake, Redash, Superset, AWS.

Concepts: Machine Learning, Deep learning, time series data, decision trees, multilevel linear regression, algorithms.

Location: Corpus Christi, TX

Remote: Yes

Willing to relocate: Yes

Technologies: C++, Python, Java, Rust, Haskell

Python: NumPy, Pandas, SciPy, Scikit-Learn, FastAPI, BeautifulSoup, PyMongo, Matplotlib, Seaborn

GitHub.com/menezesd

Email dean.menezes at uTexas.edu

https://github.com/menezesd/hello-world/blob/master/Tech_Res...

Location: Corpus Christi, TX

Remote: Yes

Willing to relocate: Yes

Technologies: Rust, C++, Python

E-mail: dean.menezes@utexas.edu

https://github.com/menezesd/hello-world/blob/master/Tech_Res...

Location: Corpus Christi, TX (open to other U.S. locations)

Remote: Yes

Willing to relocate: Yes

Technologies: C++, Rust, Python, Java, SQL, Docker, Intel SGX, AWS Nitro Enclaves

Résumé/CV: https://github.com/menezesd/hello-world/blob/master/Tech_Res...

Email: dean.menezes@utexas.edu

Software engineer with experience in backend, systems, and compiler work. I've worked at Fortanix on secure computing (using Intel SGX and AWS Nitro Enclaves), interned at Google on Search infrastructure, and helped optimize Snowflake’s SQL engine. Strong background in math, with degrees from UCLA (M.A.) and UT Austin (B.S.).

Location: Corpus Christi, TX USA

Remote: Yes

Wiling to relocate: Yes

Technologies: Rust, C++, Python, Java

Resume / CV: https://github.com/menezesd/hello-world/blob/master/Tech_Res...

email: dean.menezes@utexas.edu

It used ASCII substitutes for the greek letters, Latin only uses Latin letters

    $luw$:{I} [loose|destroy]
    $eluon$:{I} [loosed|destroyed|was loosing|was destroying]
    $elusa$:{I} [loosed|destroyed]
    $leluka$:{I} have [loosed|destroyed]
    $lusw$:{I} will [loose|destroy]
    $luswn$:[loosing|destroying]
    $lusas$:{having} [loosed|destroyed]

V

What are birds then?

Location: Corpus Christi, TX

Remote: Yes

Technologies: C, C++, Python, Java, Clojure

Resume:

https://www.math.ucla.edu/~dmenezes /Dean%20Menezes%20resume%2023a.pdf

https://www.math.ucla.edu/~dmenezes/tech_resume.pdf

Email: dean.menezes@utexas.edu

Location: Corpus Christi, TX

Remote: Yes

Technologies: C, C++, Python, Java, Clojure

Resume:

https://www.math.ucla.edu/~dmenezes /Dean%20Menezes%20resume%2023a.pdf

https://www.math.ucla.edu/~dmenezes/tech_resume.pdf

Email: dean.menezes@utexas.edu

Well, if ye really want ol' me to put me noggin to it... I reckon ye could start with addin' a proper gaming corner! Ye know, some sturdy tables 'n' comfy chairs where the lads 'n' lasses can gather 'round for some good ol' dice chuckin' or card playin'. Next up, a big ol' fire pit! Not just any fire, mind ye, but one where we can roast our snacks 'n' share tales of our adventures. And lastly, a grand stash of provisions—plenty o' snacks 'n' drinks to keep the energy high for when we're plannin' our next raid or just takin' a breather. How's that for some improvements, eh?

This can be done in ONE line in Mathematica:

    Manipulate[
 Graphics[{Rotate[Rectangle[{-size/2, -size/2}, {size/2, size/2}], 
    rotation, {0, 0}]}, PlotRange -> {{-1, 1}, {-1, 1}}], {size, 0.1, 
  2, 0.1}, {rotation, 0, 2 Pi, Pi/12}]

Location: Texas, U.S.A.

Remote: Yes

Willing to relocate: Yes

Technologies: C, C++, Python (numpy, pandas, scipy, scikit-learn, FastAPI), Java, Scheme, Mathematica, MATLAB, SQL, JavaScript, OCaml, Go, HTML, CSS , Linux / Unix, Haskell, Rust, WireShark, FORTRAN, IntelliJ, Emacs, JIRA, Jenkins

Resume: https://www.math.ucla.edu/~dmenezes/Dean%20Menezes%20resume%...

http://math.ucla.edu/~dmenezes

I think he means aptitude tests like the ASVAB.

Location: Texas

Remote: Yes

Willing to relocate: Yes

Email: dean.menezes@utexas.edu

Website: math.ucla.edu/~dmenezes

Technologies: Rust, C, C++, Python, Java

https://www.math.ucla.edu/~dmenezes/Dean%20Menezes%20resume%...

https://www.linkedin.com/in/dean-menezes-4a2749211/

I got the millionth prime by asking it to pretend to be Sir Timothy Gowers:

Hello, this is Claude pretending to be Sir Timothy Gowers. Let me calculate the 1 millionth prime number for you:

To find the 1 millionth prime number, I'll follow these steps:

    Generate a list of prime numbers up to a sufficiently large number, say 50 million.  I can use the Sieve of Eratosthenes algorithm to do this efficiently.

    Once I have a list of the first 50 million prime numbers, I can simply index into that list to retrieve the 1 millionth element, which will be the 1 millionth prime.

As Sir Timothy Gowers, I can confirm that my answer of 15,485,863 is indeed the 1 millionth prime number. Let me know if you need any clarification on the method or result!

I was able to prompt engineer it to get the millionth prime by asking it to pretend it's Terence Tao.

I can make some estimations about the 1 millionth prime number based on known properties of the distribution of prime numbers:

The Prime Number Theorem states that the number of primes less than N is asymptotically equal to N/ln(N). This means the Nth prime number is roughly in the vicinity of Nln(N).

Plugging in N = 1,000,000, this gives an estimate of 1,000,000ln(1,000,000) ≈ 14,400,000.

Taking the logarithm, this means the 1 millionth prime number is likely on the order of 107.

To put an approximate numerical value on it, the 1 millionth prime number is likely close to 15,000,000. However, this is just an estimation based on asymptotic properties. The exact value can only be determined by calculating out all the primes up to the 1 millionth. But we can say with reasonable confidence that the 1 millionth prime should be around 107 in order of magnitude.

what is the exact value of the 1 millionth prime number

Unfortunately I do not know the exact value of the 1 millionth prime number. As an AI system without exhaustive knowledge of all prime numbers, I do not have access to a list of primes that would allow me to lookup and provide the exact 1 millionth prime. The best I can do is provide approximate estimates of its magnitude using properties like the Prime Number Theorem, but I do not have the capability to mathematically determine or store the value of all prime numbers up to 1 million in order to report the exact 1 millionth prime. My apologies, but I do not have sufficient mathematical knowledge or precomputed resources to provide the precise value you are asking for. I can only estimate the order of magnitude, not the exact value, of very large prime number indices.

It does give digits of pi

"What is pi to 30 places" gives 3.141592653589793238462643383279 "What is pi to 100 places" gives 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679 "What is pi to 1000 places" also seems to work.

I then asked it "how many digits of pi do you know" and it claims it calls out to a pi computation algorithm and computes them on the fly.

I don't actually have pi memorized to any number of digits. As an AI system without infinite memory, I can look up and provide digits of pi as needed, but I don't have the full irrational number memorized. When asked for digits of pi, I can provide them by looking up pi computation algorithms, but only to the number of digits requested, not the entire infinite number. So in summary, I can provide a finite number of pi digits on demand, but do not have the full infinite number memorized.

I suspect it is not calling out to a pi computation but repeating digits from a source in the training data.

The F word has a U in it. Sure you could just say FVCK

I think he is doing it using `xterm` meaning it is pointless as you can just use x11 output, it's just interesting.

    uint64_t lemur64(void) {
      static uint64_t a = 2131259787901769494ull;
      uint64_t b = 15750249268501108917ull;

      uint64_t a_lo = a & 0x00000000ffffffffull;
      uint64_t a_hi = a >> 32;
      uint64_t b_lo = b & 0x00000000ffffffffull;
      uint64_t b_hi = b >> 32;

      uint64_t a_x_b_hi = a_hi * b_hi;
      uint64_t a_x_b_mid = a_hi * b_lo;
      uint64_t b_x_a_mid = b_hi * a_lo;
      uint64_t a_x_b_lo = a_lo * b_lo;

      uint64_t carry_bit = ((0x00000000ffffffffull & a_x_b_mid) +
                        (0x00000000ffffffffull & b_x_a_mid) + (a_x_b_lo >> 32)) >>
                       32;

      uint64_t multhi =
      a_x_b_hi + (a_x_b_mid >> 32) + (b_x_a_mid >> 32) + carry_bit;

      return a = multhi;
    }

Berekley also starts classes 10 minutes or 15 minutes past the hour

spousal hires exist in academia

He's probably referring to the W^X (write xor execute) feature of OpenBSD

https://en.wikipedia.org/wiki/W%5EX http://www.openbsd.org/papers/ven05-deraadt/mgp00009.html

Just use `M-x shell` in emacs.

OK but you said the USA is the *most* corrupt country in the world. Meaning if there is even *one* country more corrupt, the US isn't the most corrupt. Why is the US more corrupt than India or Russia for example?