Skip to main content
MathOverflow
Miliard's user avatar
Miliard's user avatar
Miliard's user avatar
Miliard
Unregistered
  • Member for 11 years, 8 months
Profile Activity

9 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
comment
Can all programs reducible to ones with only arithmetic operations on inputs be simulated with polynomial overhead by arithmetic machine?
So what I ask is if we allow recursion and other features of Turing machine that do not exist in the special machine, will there only be polynomial improvement?
awarded
 Student
revised
Can all programs reducible to ones with only arithmetic operations on inputs be simulated with polynomial overhead by arithmetic machine?
added 5 characters in body
revised
Can all programs reducible to ones with only arithmetic operations on inputs be simulated with polynomial overhead by arithmetic machine?
added 75 characters in body
awarded
 Editor
comment
Can all programs reducible to ones with only arithmetic operations on inputs be simulated with polynomial overhead by arithmetic machine?
I edited my question so that the question may make more sense.
revised
Can all programs reducible to ones with only arithmetic operations on inputs be simulated with polynomial overhead by arithmetic machine?
added 728 characters in body; added 112 characters in body
comment
Can all programs reducible to ones with only arithmetic operations on inputs be simulated with polynomial overhead by arithmetic machine?
cross-posted at math.stackexchange.com/questions/364061/…
asked
Can all programs reducible to ones with only arithmetic operations on inputs be simulated with polynomial overhead by arithmetic machine?