## Converting from m base to n base without arithmetic operations (Where m

I have been working the last 8 years in try to convert from base n to base m without artihmetical operations.

My hypothesis is that by the same way that is possible convert bases without division (see the tables bellow.) based in a literal conversion you can create an equivalence table that allow this direct translation.

``  00011111  |          (2)  |                                                              00011111  | For convert in base 4 you take the follow number of digits.                x               2   = 4 | x=2 ( It is eaxctly)  [01][11][11]| You don't need a math operation for this operation because               The follow symbol '3'(4) -> '11'(2)    [1][3][3]|          ``

`` [0011][111]| You don't need a math operation for this operation because               The follow symbol '7'(8) -> '111'(2)       [3][7]|          ``

As it is very know the number of groups that you have to use is:

Log (n) , where ( n can be represented as m^c , and c is and Integer) (m)

This operation:

``'7'(8) -> '111'(2)   (Symbol(7)->111) ``

In my case, is a not math operations, because I have an state machine that is able to understand and reflect (bad joke) that symbol 7 means 111 in the default output (or default queue).

As you know when c is not an integer, we have a very complex problem therefore I was creating random table-states based on random rules (it means jumps of states using genetic algorithms) but It has been a real waste of time/energy.

Now I share my Idea, I believe that all bases must be represented as a sub-languages for other bases and they creates a cycle , It I couldn’t demostrate it as a formal theorem. But my heart, my soul and my migth believes that it could be possible.

For example:

``(3) 0  1  2  / 10  11  12 20 /  _______  3^1 (grp)  3^2(grp) ``

``(2) 0  1  / 10  11  /  _______  2^1 (grp)  2^2(grp)  (4) 0  1 2 3 / 10 11 12 13 20 21 22 23 30 31 32 33 /  _______  4^1 (grp)  4^2(grp)  Conversion table:   GroupSize = Log(2)^4 Rule: (0/0  1/1 2/10  3/11 ) _______________________________________________________ ``

Do you have any formalism to define a base as sub-language of other base for cases like this?

Post In Edition.

## Converting non-deterministic algorithm to deterministic

I was thinking about an non-deterministic algorithm to generate all the subsets of the $$\{1..n\}$$ set.

``Subsets(n)     S' = null     for i = 1..n             u = choice(1..n)         if u in S'            fail         S' = S' + u     for_each u in S'          print u ``

How would I convert this algorithm into a deterministic form? I know that it is a lot more complicated to convert the `choice` statement in a deterministic manner but I want to get a general idea about maybe representing it in a deterministic manner.

## Converting an NPDA to a CFG

I have a question regarding conversion of NPDA to CFG. The above picture is from my lecture slides. I dont understand why they are saying 1 can be popped while transitioning from q0 to q1. It is in the first grammar production after the “or” symbol. Also, it would be great if someone explained how the conversion is working for this example in specific. Thanks!

## Need help converting template to mobile browser template.

I need little help converting this attached template file to a template which can be used in mobile browsers also.

All I need is 2 things,
1. proper font sizes so users need not zoom to read on mobiles,
If its possible, font adjusts automatically on laptop screens and does not appears too large.
What font size settings should I use?

2. and the design stretches from left to right automatically so that I can make use of available space.
I do not want the webpage to go beyond horizontal…

Need help converting template to mobile browser template.

## Do you know case studies of applications created by converting excel sheets to web app?

I want to prepare to my new project. My client is working in excel now and wants to create web app. I’m doing a research to get inspired, but I can’t find cases like that. Do you know case studies, when excel sheets is converting to web app?

## How to remove useless productions while converting push down automata into context free grammar

Here is the half solved example of the problem. (https://i.stack.imgur.com/IkOwz.jpg)

## TRAFFIC Secret – I Will Show You SECRET Website Where I Get 25000 Unique High Converting Daily HUMAN for \$2

by: KishoreValavan
Created: —
Category: Traffic
Viewed: 216

## Converting Calming Animals from GURPS Magic to Dark Ages: Mage

As an exercise, I’m trying to adapt spells from GURPS Magic (I only have the Brazilian Portuguese version and I don’t have any idea of which edition it is, but it seems to be an old one) to Dark Ages: Mage. There is a spell named Calming Animals. The description is something like that:

Allows the operator to calm a single animal. The animal’s Reaction check against the operator will receive a bonus equal to twice the energy applied to the spell.

Ignoring the general rules from GURPS Magic, I wonder if those Pillar ranks would match such effect:

• Archangels: Repha-El・・・
• Seasons: Autumn・・
• Forma: Corona・・・
• Totems: Chieftain・・・
• Runes: Forlog・・

I’m looking for answers that might confirm that this build is correct or, if it’s not the case, what would be the correct build and the logic applied.

## Converting Calming Animals from GURPS Magic to Dark Ages: Mage

As an exercise, I’m trying to adapt spells from GURPS Magic (I only have the Brazilian Portuguese version and I don’t have any idea of which edition it is, but it seems to be an old one) to Dark Ages: Mage. There is a spell named Calming Animals. The description is something like that:

Allows the operator to calm a single animal. The animal’s Reaction check against the operator will receive a bonus equal to twice the energy applied to the spell.

Ignoring the general rules from GURPS Magic, I wonder if those Pillar ranks would match such effect:

• Archangels: Repha-El・・・
• Seasons: Autumn・・
• Forma: Corona・・・
• Totems: Chieftain・・・
• Runes: Forlog・・

I’m looking for answers that might confirm that this build is correct or, if it’s not the case, what would be the correct build and the logic applied.

## Unable to detect/boot Windows 10 after converting Ubuntu from MBR+BIOS to GPT+EFI

TL;DR
How can I boot from a EFI GRUB installation on a disc A a Windows 10 BIOS installation on a disk B?

Long explanation
`os-prober` is not detecting Windows anymore after having migrated Ubuntu from MBR+BIOS to GPT+EFI.

My disk situation is a little complicated:

``sda                    1,8T                               └─sda1      ext4       1,4T /media/Steam                 Steam sdb                  931,5G                               ├─sdb1      vfat       512M                               ├─sdb2      ext4       125G                              home ├─sdb3      ext4     774,5G /media/Dati_ext4             Dati_ext4 └─sdb4      ext4      31,5G                              Ubuntu18.04 sdc                  232,9G                               ├─sdc1      ntfs       100M                               ├─sdc2      ntfs        59G                              Win10 ├─sdc3      ntfs       483M                               └─sdc4      ntfs     172,9G                              Dati_NTFS nvme0n1                477G                               ├─nvme0n1p1 ext4      62,4G /                            Ubuntu19.10 ├─nvme0n1p2 vfat       200M /boot/efi                    EFI └─nvme0n1p3 ext4     322,1G /home                        home ``
• I have 4 disks (1 NVMe and 3 SSDs).
• Before today they were all using MBR and the UEFI was booting the NVMe in legacy mode.
• I have 2 installation of Ubuntu (19.10 and 18.04) and 1 of Windows 10.
• Each OS has it’s own disk (and the 4th disk as no OS installed). This means that each OS had its own boot loader installed on the MBR of each disk.
• GRUB was also able to see every other OS so, from the GRUB of the NVMe, I was able to boot any of the 3 OSs.

Today I decided to convert the NVMe installation of Ubuntu form MBR+BIOS to GPT+EFI. Since I did not touch any other disk, I was hoping that the GRUB will detect the other OSs and boot them normally.

The conversion worked fine and I’m able to boot in Ubuntu 19.10. But `os-prober` recognize Ubuntu 18.04 but not Windows 10.

What I would like to do is either to find a fix for `os-prober`, so that it recognize Windows, or to manually specify the GRUB configuration to boot the Windows MBR+BIOS installation.

I already tried something for the second approach but it didn’t worked. I added this to the `/etc/grub.d/40_custom` of the EFI installation:

``menuentry 'Windows 10 (su /dev/sdc1)' --class windows --class os {     insmod part_msdos     insmod ntfs     set root='hd2,msdos1'     if [ x\$  feature_platform_search_hint = xy ]; then       search --no-floppy --fs-uuid --set=root --hint-bios=hd2,msdos1 --hint-efi=hd2,msdos1 --hint-baremetal=ahci2,msdos1  C08E2C498E2C3A74     else       search --no-floppy --fs-uuid --set=root C08E2C498E2C3A74     fi     parttool \$  {root} hidden-     drivemap -s (hd0) \$  {root}     chainloader +1 } ``

I took that from the working Ubuntu 18.04 GRUB MBR+BIOS installation.

But when I select Windows 10 from the GRUB menu I get just this error:

``Setting partition type to 0x7 error: can't fine command `drivemap'. error: invalid EFI file path. ``

Is it even possible to boot from an EFI GRUB a BIOS installation on a different disk of Windows 10?