I’m trying to build a deterministic Turing Machine that takes 2 words w1, w2 ∈ {a, b, c, d}* separated in the form of Bw1#w2B and determine whether w2 is a substring of w1. Turing machine should reject eg; b#abcd or aaa#b. In other words, the length of w2 must be less than the length of w1 and w2 must be a substring of w1.

# Tag: machine

## Similarities between Babbage’s difference engine and the Turing machine

What would you consider similarities between the difference engine and the Turing machine? At this point I feel I know how they both function, yet I can’t point out any worthwhile similarities between the two. And how do these two relate to modern phones? Other than the first two being milestones of computational science. I have this task as an assignment.

## Similarities between Babbage’s difference engine and the Turing machine

What would you consider similarities between the difference engine and the Turing machine? At this point I feel I know how they both function, yet I can’t point out any worthwhile similarities between the two. And how do these two relate to modern phones? Other than the first two being milestones of computational science. I have this task as an assignment.

## Is it possible for a Turing machine to halt without reading the complete input string?

Is it possible for a Turing machine to halt without reading the complete input string. Suppose there is a string “adc” preceded and succeeded by infinite number of blanks. Can a Turing machine halt after reading just “a” and never touching “dc” or any of the blanks. If yes, will this string be accepted or rejected?

## Example 4.1.9 Right shift Turing Machine from Elements of the Theory of Computation by Papadimitriou Page 190

I tried to trace this machine with an example but failed to conclude that the machine is really a right shift machine.

I tried to create a right shift machine.

Which one is wrong and what did I miss?

## How to find out the complement of a Turing machine?

With only using our thinking. What do I have to think about when finding a complement of a Turing machine for example.

L={M∣M is a TM that halts on empty tape after even transition steps} What’s the complement of L would it be:

- L={M∣M is a TM that does not halt on empty tape after even transition steps}
- L={M∣M is a TM that halts on empty tape after odd transition steps}

Please give me your train of thought when coming up with a complement for an automaton.

## Is there a way to use a virtual machine with a partition of linux?

So I have a huge issue with grub, I don’t think I’m gonna be able to solve it. But, I am able to use my windows partition, and I’ve been able to get all my files from the linux partition with “DiskInternal Linux Readers”

I also would like to be able to browse the internet on the linux partition to get information from the browsers (Namely passwords and usernames that are saved on firefox).

Is there a way to do so from Windows ?

## Method to construct a finite state machine for a finite-size language L

I need to define a method to construct a finite automata for a finite language L (part of my proof for something else). My idea:

- Create $ |L|$ accepting states.
- For each input string $ s$ from $ L$ , create appropriate transitions from a starting state to unique accepting state of s.

I don’t know how to formally describe this, or if this idea is even good.

## Is it possible to make a dedicated Discord machine?

A lot of my friends use Discord for gaming, but I don’t like.

I had a motherboard with integrated CPU lying around (dual core Celeron at 2.1GHz) (https://www.gigabyte.com/uk/Motherboard/GA-N3050M-D3P-rev-10#ov) which I have paired with a 2GB RAM stick and a second hand SSD from eBay.

I have installed Xubuntu and gotten Discord to work. Total TDP from the wall is ~13W. It occasionally crashes after prolonged use, I think due to excess temperature, so I am planning to mount the motherboard directly onto my wall as a kind of display piece for my room as well as improving airflow.

Ultimately, my dream for this project would be a box that I turn on, and it automatically starts up Discord and joins my favourite channel and room. It is connected to the internet via a USB wifi dongle (https://wikidevi.com/wiki/TP-LINK_Archer_T4U_v3) which I have found drivers for on Git. A Turtlebeach USB headset will be used for communication, although I’m playing with the idea of pairing a separate mic with some open back headphones in the future. It won’t be connected to a monitor or to any other USB peripherals unless troubleshooting. Something simple and straightforward like this.

Is this possible? Are there any specific distributions which would be suited to this? Can this kind of functionality be programmed into Discord internally, or can some external program control Discord in an adequate way?

Ultimately I will need a cheap mixamp to mix the sound coming from my Discord box and my gaming machine, any suggestions on this are also welcome but I am aware that this isnt the focal point of this site.

-Thanks

## Hypothesis Space for Machine Learning

I have the following question on a problem set:

Considering only linear combinations of monomials $ x^k$ for $ k=0,…,K$ , describe a good hypothesis space to approximate a continuous function $ f(x)$ defined on $ (-1,1)$ under each of the following constraints:

a. No constraints: $ f(x)$ is arbitrary

b. $ f$ is even: $ f(-x) = f(x)$

c. $ f$ is odd: $ f(-x) = -f(x)$

d. $ f(-1) = 0$ and $ f(1) = 0$

e. $ f(0) = 1$

I know that we want the hypothesis space to: 1) be reasonably small and 2) contain the true hypothesis in order to ensure convergence. So, for part (b) I assume we want the hypothesis space to consist of even monomials (i.e., $ x^2,x^4,…$ ), while for part (c) I assume we want odd monomials (i.e., $ x^3,x^5,…$ ). I’m not sure about the others though. How should we think about those?