If any of my followers speak #russian and willing to help out, I'd be interested to know if they can track down a certain academics full name for me.

The only name I have is "Medvedev, Yu. T." and they wrote "Degrees of difficulty of the mass problem" in Doklady Akademii Nauk SSSR volume 104 (1955), but afaik this was not one of the volumes that were translated to english.

If there is a stable URI / DOI for that journal/paper, that would also be great.

#computability

If people could start writing down the proofs of things "everyone knows" that'd be great

Tag yourself, I'm strongly unfoldable

#settheory #logic

My own talk went well. I wasn't feeling rushed so I had a bit of fun with it.

Two others I'd shout out were Sandra Kiefer on Vertex Definability in counting logic, which was mercifully big on examples at 5pm, and Micheal Friedman oan the ideas of Hans Blumenberg & ELIZA

Pictures of the Institut fur Mathematik at Wurzburg

Steve Awodeys talk on the effective infinity topos was really good

André Curtis-Trudel's book "Computability and Computational Explanation" is currently available for free

https://www.cambridge.org/core/elements/computability-and-computational-explanation/507C583E0D5F5F840B451A113D3A0449

#computability #logic #philosophy

The category-theoretic problem with sundays is that they are only weekly terminal

I don't knit/crochet, but I do like that at every conference there is someone knitting/crocheting

@codyroux
I was listening to the most recent episode and the idea of P & NP being different under some oracle was reminding me of a similar phenomenon with regular languages.

DFAs, NFAs and 2-way DFAs all give you regular languages, but when you move to automata with string outputs they split into sequential functions, rational functions and regular functions (in order of power)

While there is some conference discourse, I'm only mostly joking when I think there should be a supply of amphetamines at computing conferences

I was without access to the internet for most of the past few days, so I wrote a blog post about lambda calculus and regular languages.

https://www.countingishard.org/blog/a-lesser-known-characterisation-of-the-regular-languages

#computability #logic #lambdacalculus

@vc has a funded PhD position at Strathclyde. Unfortunately, the funding is for *UK Home* students only, but if that applies to you and you are interested in category theory, type theory, semantics, or related topics, get in touch with them

"Problems with Fixpoints of Polynomials of Polynomials" got accepted to LICS, so pretty chuffed about that

#logic #categorytheory

Serious research question, what do you do with results you can prove, but don't have a direct use for/don't fit into the narrative you are trying to write?

Just hold on to them for a rainy day?

#research #adviceNeeded

Didn't see this at the time, but the paper "Type-Safe Blazon: Enforcing Pedantry in Heraldic Design" from FARM 25 is right in my wheelhouse

https://dl.acm.org/doi/10.1145/3759162.3759641

#heraldry #typetheory

Is there any good latex package for building an index of notation?

#texlatex

If all goes well, I'll be graduating as Dr. CiH later this year, so if you see any good postdocs in categories, types, computability, logic, etc. feel free to ping me

In which a bad dream leads to a rant...

https://www.countingishard.org/blog/i-want-you-to-give-better-talks

Does anyone have a cite for the grothendieck construction in the case that your indexed categories are not split? (The below photographs are from Bart Jacobs' book)

My instinct is just to replace natural transformation with pseudo natural transformation in the defn of morphism of indexed categories and change split fibrations to clove fibrations

Most books I have e.g. Johnson Yau & the elephant book only handle the case where the indexing category is the same

#categorytheory