Development ceased in 2021 and was taken up by a not-for-profit as Farama Gymnasium.
P for quantum computing!
Heck, we know nothing about this class yet related to non quantum classes!
- conjectured not to intersect with NP-complete, because if it were, all NP-complete problems could be solved efficiently on quantum computers, and none has been found so far as of 2020.
- conjectured to be larger than P, but we don't have a single algorithm provenly there:
- it is believed that the NP complete ones can't be solved
- if they were neither NP-complete nor P, it would imply P != NP
- we just don't know if it is even contained inside NP!
This is apparently where past exam papers can be found. Paywalled of course.
The paywall is stupid however, as they seem to provide past papers upon request, e.g.
This adds to the mess of having a different location for material per department. Presumably this exists because the central university authority wants to centralize examinations to have better control over degree requirements. If only they would also do the same for all materials and end the mess.
- something about finding a unitary representation of the poincare group
Cannot update a component while rendering a different component warning in React Updated 2025-04-05 +Created 1970-01-01
The last value we will likely every know for the busy beaver function! BB(6) is likely completely out of reach forever.
By 2023, it had basically been decided by the The Busy Beaver Challenge as mentioned at: discuss.bbchallenge.org/t/the-30-to-34-ctl-holdouts-from-bb-5/141, pending only further verification. It is going to be one of those highly computational proofs that will be needed to be formally verified for people to finally settle.
As that project beautifully puts it, as of 2023 prior to full resolution, this can be considered the:on the Busy beaver scale.
simplest open problem in mathematics
Unlisted articles are being shown, click here to show only listed articles.