User talk:CircuitCraft
Welcome to ProofWiki! Since you're new, you may want to check out the general help page. It's the best first stop to see how things are done (next to reading proofs, of course!). Please feel free to contribute to whichever area of mathematics interests you, either by adding new proofs, or fixing up existing ones. If you have any questions please feel free to contact one of the administrators, or post your question on the questions page.
Here are some useful pages to help get you started:
- Community Portal - To see what needs to be done, and keep up to date with the community.
- Recent Changes - To keep up with what's new, and what's being added.
- Check out our house style if you are keen on contributing.
- Main Page talk - This is where most of the main discussions regarding the direction of the site take place. If you have any ideas, please share them!
Cheers! prime mover (talk) 06:09, 10 January 2023 (UTC)
Turing machines
Great start. I have the 2nd ed of the Hopcroft and Ullman badly water damaged from my first degree. Loved it. Difficult to transcribe to ProofWiki style. Thanks for taking it on. --prime mover (talk) 00:16, 22 January 2023 (UTC)
- Nope, it's the first edition I have, not the 2nd. I will give it a close study. --prime mover (talk) 09:20, 22 January 2023 (UTC)
Categories
Please can you make sure that when you add new proofs (and in fact any new page) that you add the category? Many thanks. --prime mover (talk) 06:31, 24 February 2023 (UTC)
- Sorry about that. I'll try to go back and add them to my previous contributions. --CircuitCraft (talk) 12:43, 24 February 2023 (UTC)
recent work
Thank you for your recent edits. Please keep up the good work, it makes a difference. --prime mover (talk) 18:50, 3 March 2023 (UTC)
trusted user
Hi
I have added your user account to the "Trusted Users" group.
You should now be able to move and delete pages according to your judgment.
Have fun. --prime mover (talk) 17:32, 24 March 2023 (UTC)
- Thank you! I'll try to not mess anything up too badly. I don't know if I would describe myself as a "good worker" though; I usually write on $\mathsf{Pr} \infty \mathsf{fWiki}$ in order to waste time, when I should be doing other things! --CircuitCraft (talk) 19:26, 24 March 2023 (UTC)
induction proofs
Please note the structural changes that I have made to your recent induction proofs.
The headings of a proof page do not contain links back to the definition as we reserve heading links to go to a transcluded page containing the proof.
You may wish to copy existing induction proofs to see the standard structure as implemented on $\mathsf{Pr} \infty \mathsf{fWiki}$.
If you do many of these proofs you are encouraged to set up a template like what I did: User:Prime.mover/Proof Structures/Proof by Mathematical Induction and similar.
Cheers --prime mover (talk) 08:28, 23 September 2023 (UTC)
Linking to specific definitions
Like this:
Not actually a good idea. Unless you are relying on a specific route through, it makes it yay more difficult to maintain. If the definition is named then yes, there is a case for it. If the definitions are just numbered, then use the parent page, which presents all definitions on it. The reader can find the one being used. This setup seems to work.
Thanks for your continued contribution. I repeat, I am extremely happy to have you on board. --prime mover (talk) 18:14, 20 November 2023 (UTC)
moving pages
Please note that when you move a whole bunch of content from one page to another, e.g. the good work you did setting up Limit to Infinity of Binomial Coefficient over Power/Proof 1 from Limit to Infinity of Binomial Coefficient over Power, that when you also move the Sources section as well, you also need to change the redirection targets of the pages which point towards it.
Specifically that is so the "previous" and "next" links point to the correct pages.
In this case, we have, on page: Approximation to x+y Choose y, to change:
- * {{BookReference|The Art of Computer Programming: Volume 1: Fundamental Algorithms|1997|Donald E. Knuth|ed = 3rd|edpage = Third Edition|prev = Limit to Infinity of Binomial Coefficient over Power|next = Approximation to 2n Choose n}}: $\S 1.2.6$: Binomial Coefficients: Exercise $46$
to:
- * {{BookReference|The Art of Computer Programming: Volume 1: Fundamental Algorithms|1997|Donald E. Knuth|ed = 3rd|edpage = Third Edition|prev = Limit to Infinity of Binomial Coefficient over Power/Proof 1|next = Approximation to 2n Choose n}}: $\S 1.2.6$: Binomial Coefficients: Exercise $46$
and similarly on Binomial Coefficient of Real Number with Half.
This is the main reason behind the instruction at the top of the {{Refactor}} template that requests that refactoring tasks are left to experienced editors only.
Also please note that unless you have the work on hand that specifically contains the actual proof you are moving, it is best to leave the sources where they are on the master page, because we only put the citation onto the proof page if the actual proof is presented on that page.
In this case it is a borderline case. This proof was presented as an exercise in Knuth, and technically speaking, only a hint was presented in the answer section, so there's a case for leaving the source on the master page and not putting it in the proof page.
I appreciate that this is difficult to follow, but when this was set up, it was assumed that it would be intuitively clear to the contributors how this would work.
Thanks anyway --prime mover (talk) 08:11, 26 April 2024 (UTC)
- Apologies, I completely forgot about that. I am familiar with the way it's supposed to work; I've just never had to do an operation like that before, and forgot to take the appropriate steps. I'll try to not make the same mistake again. --CircuitCraft (talk) 15:19, 26 April 2024 (UTC)