User talk:Alberto Pettorossi

Managing a conflict of interest

Hello, Alberto Pettorossi. We welcome your contributions, but if you have an external relationship with the people, places or things you have written about on Wikipedia, you may have a conflict of interest (COI). Editors with a conflict of interest may be unduly influenced by their connection to the topic. See the conflict of interest guideline and FAQ for organizations for more information. We ask that you:

avoid editing or creating articles about yourself, your family, friends, colleagues, company, organization or competitors;
propose changes on the talk pages of affected articles (you can use the {{request edit}} template);
disclose your conflict of interest when discussing affected articles (see Wikipedia:Conflict of interest#How to disclose a COI);
avoid linking to your organization's website in other articles (see WP:Spam);
do your best to comply with Wikipedia's content policies.

In addition, you are required by the Wikimedia Foundation's terms of use to disclose your employer, client, and affiliation with respect to any contribution which forms all or part of work for which you receive, or expect to receive, compensation. See Wikipedia:Paid-contribution disclosure.

Also, editing for the purpose of advertising, publicising, or promoting anyone or anything is not permitted. Thank you. MrOllie (talk) 20:51, 14 June 2020 (UTC)[reply]

Editing "Tower of Hanoi" Wikipedia page - some proposed changes

This edit request by an editor with a conflict of interest has now been answered.

Information to be added:

After: "The sequence of these unique moves is an optimal solution to the problem equivalent to the iterative solution described above.[7]"

Please add the following sentence:

The iterative solutions can be found in a mechanical way starting from the recursive ones as indicated in ^[1] by using the tupling strategy. That strategy, which works also in the case of the cyclic and generalized versions of the problem (see below), is based on syntactic matchings of expressions. Thus, no proof of correctness of the derived programs is necessary. The tupling strategy has been first used in the seminal paper on program transformation by R. M. Burstall and J. Darlington^[2].

This edit request by an editor with a conflict of interest has now been answered.

Explanation of issue: I think that it was important to indicate that once you have the recursive solution, you may have the iterative solution "for free". No intricate proofs of the iterative versions are necessary.

References supporting change: here you have also the doi of my paper:

@ARTICLE(Pet85a, AUTHOR = " A. Pettorossi", TITLE = "Towers of {H}anoi Problems: Deriving Iterative Solutions by Program Transformation ", JOURNAL = "BIT ", YEAR = 1985, volume = 25, pages = " 327--334", note = "doi.org/10.1007/BF01934378" ).

My homepage: http://www.iasi.cnr.it/~adp/

I wrote to prof. Gedeon who did also some work in 1996 the derivation of iterative solutions (see reference 11). But no answer from him as yet. Alberto Pettorossi (talk) 10:55, 18 June 2020 (UTC) Alberto Pettorossi[reply]

Alberto Pettorossi (talk) 10:42, 18 June 2020 (UTC) Alberto Pettorossi[reply]

@Alberto Pettorossi: You need to put your edit request on the article's talk page (Talk:Tower of Hanoi). How are you related to Tower of Hanoi? Darth Flappy ^«Talk» 14:51, 18 June 2020 (UTC)[reply]

^ Pettorossi A., "Towers of Hanoi Problems: Deriving Iterative Solutions By Program Trasformations". BIT 25, 327-334, 1985
^ Burstall R.M. and Darlington J., "A Transformation System for Developing Recursive Programs", JACM, 24(1), 44-67, 1977

[1] Pettorossi A., "Towers of Hanoi Problems: Deriving Iterative Solutions By Program Trasformations". BIT 25, 327-334, 1985

[2] Burstall R.M. and Darlington J., "A Transformation System for Developing Recursive Programs", JACM, 24(1), 44-67, 1977

[1]

[2]