Timeline for Basic mapping reductions without using Turing machines
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 24, 2017 at 14:15 | vote | accept | aradona | ||
| Jul 24, 2017 at 14:12 | comment | added | Rick Decker | @aradona A suitable reduction would be a function $f$ which is defined to map 0 and 1 to 0 and any other input to 1. | |
| Jul 24, 2017 at 14:07 | comment | added | aradona | I am over the Alphabet of {0,1} so for input x = 000 i need tu return an instance other then 0. tnx | |
| Jul 24, 2017 at 14:00 | vote | accept | aradona | ||
| Jul 24, 2017 at 14:01 | |||||
| Jul 24, 2017 at 13:46 | history | answered | Yuval Filmus | CC BY-SA 3.0 |