You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to Kolmogorov seminar on complexity
Milovanov about Allender's question: There exists a unviersal
decompressor U such that no polynomial machine reduces the halting
problem to the complexity function C_U (, mostly in English, to be
continued next time)
https://youtu.be/cDJixvtv62U