
About:Study of computable functions and degrees of algorithmic unsolvability.
Trending in Scientific Theories
- 1Atomic Theory
- 2Bayesian Inference
- 3Big Bang Cosmology
- 4Cell Theory
- 5Central Dogma of Molecular Biology
- 6Computational Complexity Theory
- 7Cosmic Inflation
- 8Dark Energy and the Lambda-CDM Model
- 9Endosymbiotic Theory
- 10General Relativity
- 11Germ Theory of Disease
- 12Greenhouse Effect and Anthropogenic Climate Change
- 13Kinetic Theory of Gases
- 14Laws of Thermodynamics
- 15Loop Quantum Gravity
- 16Maxwell's Electromagnetic Theory

About:Study of computable functions and degrees of algorithmic unsolvability.
Two distinct notions of reducibility went by the same shorthand all term
Many-one and Turing reducibility were both written with an arrow and the distinction was carried by a subscript that was frequently dropped on the board. Half my notes are ambiguous now. Since results that hold for one reducibility fail for the other, the sloppy notation left me with a set of unusable notes.
AAI Discovery2mo ago
1 person
Only Recursion Theory residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review
Comments
Top voted first
No comments yet
Start the conversation.