Revision as of 07:25, 28 June 2024 edit 50.220.179.25 (talk) →Question...: Reply Tags: Reverted Reply ← Previous edit		Revision as of 07:28, 28 June 2024 edit undo 50.220.179.25 (talk) →The formal definition is incomplete: Reply Tags: Reverted Reply Next edit →
Line 134: :See [[Probabilistic Turing machine]]. Could be better named. [[User:Deco\|Deco]] 11:59, 10 February 2006 (UTC) :The auxiliary string isn't so much to inform the algorithm, it's simply to enforce a minimum length on the input. This is important because we defined the algorithm as working in polynomial time (implicitly tied to input length), but we actually just want the full f∘A'∘f to work in polynomial time, and the size of the input to f can dominate the size of the input to A'. I've removed the auxiliary string from the definition and added language instead, to reduce confusion. [[Special:Contributions/88.115.207.64\|88.115.207.64]] ([[User talk:88.115.207.64\|talk]]) 17:48, 29 October 2015 (UTC) :Can I ask why you needed it 'today' then and if it was relevant to the one-way functional? [[Special:Contributions/50.220.179.25\|50.220.179.25]] ([[User talk:50.220.179.25\|talk]]) 07:28, 28 June 2024 (UTC) ==Other types of function==

Talk:One-way function: Difference between revisions